<!doctype html public "-//W3C//DTD HTML 4.0 Transitional//EN" "http://www.w3.org/TR/REC-html40/loose.dtd">
<html>
<!-- Generated from TeX source by tex2page, v 4o, 
     (c) Dorai Sitaram, http://www.cs.rice.edu/~dorai/tex2page -->
<head>
<title>
Structure and Interpretation 
of Computer Programs
</title>
<link rel="stylesheet" type="text/css" href="book-Z-C.css" title=default>
<meta name=robots content="noindex,follow">
</head>
<body>

<p><div class=navigation>[Go to <span><a href="book.html">first</a>, <a href="book-Z-H-37.html">previous</a></span><span class=disable>, next</span> page<span>; &nbsp;&nbsp;</span><span><a href="book-Z-H-4.html#%_toc_start">contents</a></span><span class=disable><span>; &nbsp;&nbsp;</span>index</span>]</div><p>

<a name="%_chap_Temp_851"></a>
<h1 class=chapter>
<div class=chapterheading>&nbsp;</div><p>
<a href="book-Z-H-4.html#%_toc_%_chap_Temp_851">Index</a></h1><p>

<p>
<div align=right> 
<table width=60%><tr><td>
<span class=epigraph>

Any inaccuracies in this index may be explained by the fact that it
has been prepared with the help of a computer.
<p><a name="%_idx_6794"></a>Donald E. Knuth,
<em>Fundamental Algorithms</em> (Volume 1 of
<em>The Art of Computer Programming</em>)
</span>
</td></tr></table>
</div>

<p>
<p><a name="%_index_start"><p>

<br>
<a href="book-Z-H-20.html#%_idx_2872"><tt>!</tt> in names</a><br>
<a href="book-Z-H-16.html#%_idx_2008"><tt>&quot;</tt> (double quote)</a><br>
<img src="book-Z-G-D-6.gif" border="0">  calculus, <em>see</em> lambda calculus
<br>
<a href="book-Z-H-12.html#%_idx_1122"> <img src="book-Z-G-D-17.gif" border="0">   notation for mathematical function</a><br>
<img src="book-Z-G-D-9.gif" border="0"> , <em>see</em> pi
<br>
<a href="book-Z-H-12.html#%_idx_986">sum  (sigma) notation</a><br>
<img src="book-Z-G-D-4.gif" border="0"> , <em>see</em> theta
<br>
<a href="book-Z-H-16.html#%_idx_2000"><tt>'</tt> (single quote)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4526"><tt>read</tt> and</a>, 
<a href="book-Z-H-29.html#%_idx_5406">[2]</a><br>
<a href="book-Z-H-10.html#%_idx_168"><tt>*</tt> (primitive multiplication procedure)</a><br>
<a href="book-Z-H-10.html#%_idx_162"><tt>+</tt> (primitive addition procedure)</a><br>
<a href="book-Z-H-35.html#%_idx_6288"><tt>,</tt> (comma, used with backquote)</a><br>
<a href="book-Z-H-10.html#%_idx_170"><tt>-</tt> (primitive subtraction procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_410">as negation</a><br>
<a href="book-Z-H-10.html#%_idx_176"><tt>/</tt> (primitive division procedure)</a><br>
<a href="book-Z-H-10.html#%_idx_394"><tt>&lt;</tt> (primitive numeric comparison predicate)</a><br>
<a href="book-Z-H-10.html#%_idx_396"><tt>=</tt> (primitive numeric equality predicate)</a><br>
<a href="book-Z-H-16.html#%_idx_2090"><tt>=number?</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2568"><tt>=zero?</tt> (generic)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2752">for polynomials</a><br>
<a href="book-Z-H-10.html#%_idx_392"><tt>&gt;</tt> (primitive numeric comparison predicate)</a><br>
<a href="book-Z-H-10.html#%_idx_470"><tt>&gt;=</tt></a>, <a href="book-Z-H-10.html#%_idx_472">[2]</a><br>
<a href="book-Z-H-10.html#%_idx_524"><tt>?</tt> , in predicate names</a><br>
<a href="book-Z-H-10.html#%_idx_378"><tt>#f</tt></a><br>
<a href="book-Z-H-10.html#%_idx_372"><tt>#t</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6286"><tt>`</tt> (backquote)</a><br>
<tt>;</tt>, <em>see</em> semicolon<p>

<p><p>

<br>
<a href="book-Z-H-9.html#%_idx_106">Abelson, Harold</a><br>
<a href="book-Z-H-10.html#%_idx_358"><tt>abs</tt></a>, <a href="book-Z-H-10.html#%_idx_414">[2]</a>, 
<a href="book-Z-H-10.html#%_idx_418">[3]</a><br>
<a href="book-Z-H-10.html#%_idx_348">absolute value</a><br>
<a href="book-Z-H-14.html#%_idx_1282">abstract data</a>, 
<em>see also</em> data abstraction
<br>
<a href="book-Z-H-14.html#%_idx_1426">abstract models for data</a><br>
abstract syntax
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4236">in metacircular evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5296">in query interpreter</a><br>
abstraction, <em>see also</em> means of abstraction; data abstraction; higher-order procedures
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_980">common pattern and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-25.html#%_idx_4196">metalinguistic</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_576">procedural</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5546">in register-machine design</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4924">of search in nondeterministic programming</a><br>
<a href="book-Z-H-13.html#%_idx_1264">abstraction barriers</a>, 
<a href="book-Z-H-14.html#%_idx_1380">[2]</a>, <a href="book-Z-H-17.html#%_idx_2286">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2304">in complex-number system</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2498">in generic arithmetic system</a><br>
<a href="book-Z-H-24.html#%_idx_3976"><tt>accelerated-sequence</tt></a><br>
<a href="book-Z-H-12.html#%_idx_1018"><tt>accumulate</tt></a>, 
<a href="book-Z-H-15.html#%_idx_1742">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1810">same as <tt>fold-right</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1794"><tt>accumulate-n</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1736">accumulator</a>, <a href="book-Z-H-20.html#%_idx_2902">[2]</a><br>
<a href="book-Z-H-11.html#%_idx_748">&Aacute;ch&aacute;rya, Bh&aacute;scara</a><br>
<a href="book-Z-H-11.html#%_idx_708">Ackermann's function</a><br>
<a href="book-Z-H-23.html#%_idx_3642">acquire a mutex</a><br>
<a href="book-Z-H-31.html#%_idx_5534">actions, in register machine</a><br>
<a href="book-Z-H-27.html#%_idx_4722"><tt>actual-value</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5168">Ada</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_684">recursive procedures</a><br>
<a href="book-Z-H-26.html#%_idx_4646">Adams, Norman I., IV</a><br>
<a href="book-Z-H-18.html#%_idx_2504"><tt>add</tt> (generic)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2710">used for polynomial coefficients</a>, 
<a href="book-Z-H-18.html#%_idx_2714">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3374"><tt>add-action!</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3408">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4476"><tt>add-binding-to-frame!</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2312"><tt>add-complex</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2578"><tt>add-complex-to-schemenum</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1488"><tt>add-interval</tt></a><br>
<a href="book-Z-H-27.html#%_idx_4786"><tt>add-lists</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2674"><tt>add-poly</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1308"><tt>add-rat</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5382"><tt>add-rule-or-assertion!</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3864"><tt>add-streams</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2708"><tt>add-terms</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3420"><tt>add-to-agenda!</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3472">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1938"><tt>add-vect</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2074"><tt>addend</tt></a><br>
adder
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3364">full</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3356">half</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3390">ripple-carry</a><br>
<a href="book-Z-H-22.html#%_idx_3532"><tt>adder</tt> (primitive constraint)</a><br>
<a href="book-Z-H-13.html#%_idx_1278">additivity</a>, <a href="book-Z-H-17.html#%_idx_2290">[2]</a>, 
<a href="book-Z-H-17.html#%_idx_2426">[3]</a>, <a href="book-Z-H-18.html#%_idx_2534">[4]</a><br>
<a href="book-Z-H-33.html#%_idx_5834">address</a><br>
<a href="book-Z-H-33.html#%_idx_5838">address arithmetic</a><br>
<a href="book-Z-H-11.html#%_idx_926">Adelman, Leonard</a><br>
<a href="book-Z-H-34.html#%_idx_6062"><tt>adjoin-arg</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2106"><tt>adjoin-set</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2162">binary-tree representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2132">ordered-list representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2118">unordered-list representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2274">for weighted sets</a><br>
<a href="book-Z-H-18.html#%_idx_2694"><tt>adjoin-term</tt></a>, 
<a href="book-Z-H-18.html#%_idx_2734">[2]</a><br>
<a href="book-Z-H-32.html#%_idx_5732"><tt>advance-pc</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3376"><tt>after-delay</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3424">[2]</a><br>
agenda, <em>see</em> digital-circuit simulation
<br>
<a href="book-Z-H-11.html#%_idx_826">A'h-mose</a><br>
algebra, symbolic, <em>see</em> symbolic algebra
<br>
<a href="book-Z-H-18.html#%_idx_2648">algebraic expression</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2046">differentiating</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2058">representing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2084">simplifying</a><br>
<a href="book-Z-H-14.html#%_idx_1442">algebraic specification for data</a><br>
Algol
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_628">block structure</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3806">call-by-name argument passing</a>, 
<a href="book-Z-H-27.html#%_idx_4716">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3822">thunks</a>, <a href="book-Z-H-27.html#%_idx_4700">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3568">weakness in handling compound objects</a><br>
algorithm
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1780">optimal</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_910">probabilistic</a>, 
<a href="book-Z-H-18.html#%_idx_2816">[2]</a><br>
<a href="book-Z-H-20.html#%_idx_2998">aliasing</a><br>
<a href="book-Z-H-35.html#%_idx_6374"><tt>all-regs</tt> (compiler)</a><br>
<a href="book-Z-H-33.html#%_idx_5960">Allen, John</a><br>
<a href="book-Z-H-10.html#%_idx_438">alternative of <tt>if</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5338"><tt>always-true</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4822"><tt>amb</tt></a><br>
<tt>amb</tt> evaluator, <em>see</em> nondeterministic evaluator
<br>
<a href="book-Z-H-28.html#%_idx_4994"><tt>ambeval</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4830"><tt>an-element-of</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4832"><tt>an-integer-starting-from</tt></a><br>
<a href="book-Z-H-24.html#%_idx_4064">analog computer</a><br>
<tt>analyze</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4656">metacircular</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4992">nondeterministic</a><br>
<tt>analyze-...</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4658">metacircular</a>, 
<a href="book-Z-H-26.html#%_idx_4664">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_5004">nondeterministic</a><br>
<a href="book-Z-H-28.html#%_idx_5016"><tt>analyze-amb</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4636">analyzing evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4980">as basis for nondeterministic evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4662"><tt>let</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5124"><tt>and</tt> (query language)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5198">evaluation of</a>, 
<a href="book-Z-H-29.html#%_idx_5318">[2]</a>, <a href="book-Z-H-29.html#%_idx_5428">[3]</a><br>
<a href="book-Z-H-10.html#%_idx_446"><tt>and</tt> (special form)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_450">evaluation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_466">why a special form</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4396">with no subexpressions</a><br>
<a href="book-Z-H-22.html#%_idx_3346">and-gate</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3382"><tt>and-gate</tt></a><br>
<tt>angle</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2470">data-directed</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2350">polar representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2334">rectangular representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2412">with tagged data</a><br>
<a href="book-Z-H-17.html#%_idx_2396"><tt>angle-polar</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2384"><tt>angle-rectangular</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4536"><tt>announce-output</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1764">APL</a><br>
<a href="book-Z-H-35.html#%_idx_6366">Appel, Andrew W.</a><br>
<a href="book-Z-H-15.html#%_idx_1632"><tt>append</tt></a>, <a href="book-Z-H-15.html#%_idx_1636">[2]</a>, 
<a href="book-Z-H-22.html#%_idx_3164">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1768">as accumulation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3162"><tt>append!</tt> vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6396">with arbitrary number of arguments</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5926">as register machine</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5074">``what is'' (rules) vs. ``how to'' (procedure)</a><br>
<a href="book-Z-H-22.html#%_idx_3166"><tt>append!</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5928">as register machine</a><br>
<a href="book-Z-H-35.html#%_idx_6260"><tt>append-instruction-sequences</tt></a>, 
<a href="book-Z-H-35.html#%_idx_6390">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5158"><tt>append-to-form</tt> (rules)</a><br>
<a href="book-Z-H-26.html#%_idx_4340"><tt>application?</tt></a><br>
<a href="book-Z-H-10.html#%_idx_342">applicative-order evaluation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_344">in Lisp</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_482">normal order vs.</a>, 
<a href="book-Z-H-11.html#%_idx_854">[2]</a>, <a href="book-Z-H-27.html#%_idx_4682">[3]</a><br>
<a href="book-Z-H-27.html#%_idx_4724"><tt>apply</tt> (lazy)</a><br>
<a href="book-Z-H-26.html#%_idx_4250"><tt>apply</tt> (metacircular)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4578">primitive <tt>apply</tt> vs.</a><br>
<a href="book-Z-H-17.html#%_idx_2458"><tt>apply</tt> (primitive procedure)</a><br>
<a href="book-Z-H-34.html#%_idx_6072"><tt>apply-dispatch</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6474">modified for compiled code</a><br>
<a href="book-Z-H-17.html#%_idx_2462"><tt>apply-generic</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2590">with coercion</a>, 
<a href="book-Z-H-18.html#%_idx_2626">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2636">with coercion by raising</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2632">with coercion of multiple arguments</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2638">with coercion to simplify</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2490">with message passing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2610">with tower of types</a><br>
<a href="book-Z-H-26.html#%_idx_4248"><tt>apply-primitive-procedure</tt></a>, 
<a href="book-Z-H-26.html#%_idx_4440">[2]</a>, <a href="book-Z-H-26.html#%_idx_4514">[3]</a><br>
<a href="book-Z-H-29.html#%_idx_5358"><tt>apply-rules</tt></a><br>
<a href="book-Z-H-23.html#%_idx_3684">arbiter</a><br>
<a href="book-Z-H-17.html#%_idx_2322">arctangent</a><br>
<a href="book-Z-H-34.html#%_idx_6028"><tt>argl</tt> register</a><br>
argument passing, <em>see</em> call-by-name argument passing; call-by-need argument passing
<br>
<a href="book-Z-H-10.html#%_idx_188">argument(s)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_194">arbitrary number of</a>, 
<a href="book-Z-H-15.html#%_idx_1652">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4070">delayed</a><br>
<a href="book-Z-H-23.html#%_idx_3688">Aristotle's <i>De caelo</i> (Buridan's commentary on)</a><br>
arithmetic
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5840">address arithmetic</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2496">generic</a>, 
<em>see also</em> generic arithmetic operations
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2302">on complex numbers</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1480">on intervals</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;on polynomials, <em>see</em> polynomial arithmetic
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3930">on power series</a>, 
<a href="book-Z-H-24.html#%_idx_3936">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1294">on rational numbers</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_160">primitive procedures for</a><br>
<a href="book-Z-H-28.html#%_idx_4960"><tt>articles</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2214">ASCII code</a><br>
<a href="book-Z-H-32.html#%_idx_5686"><tt>assemble</tt></a>, <a href="book-Z-H-32.html#%_idx_5694">[2]</a><br>
<a href="book-Z-H-32.html#%_idx_5636">assembler</a>, <a href="book-Z-H-32.html#%_idx_5682">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5240"><tt>assert!</tt> (query interpreter)</a><br>
<a href="book-Z-H-29.html#%_idx_5104">assertion</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5148">implicit</a><br>
<a href="book-Z-H-31.html#%_idx_5518"><tt>assign</tt> (in register machine)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5720">simulating</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5556">storing label in register</a><br>
<a href="book-Z-H-32.html#%_idx_5724"><tt>assign-reg-name</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5726"><tt>assign-value-exp</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2836">assignment</a>, <em>see also</em> <tt>set!</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2916">benefits of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_3004">bugs associated with</a>, 
<a href="book-Z-H-20.html#%_idx_3022">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2976">costs of</a><br>
<a href="book-Z-H-20.html#%_idx_2842">assignment operator</a>, 
<em>see also</em> <tt>set!</tt>
<br>
<a href="book-Z-H-26.html#%_idx_4296"><tt>assignment-value</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4294"><tt>assignment-variable</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4292"><tt>assignment?</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3282"><tt>assoc</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2324"><tt>atan</tt> (primitive procedure)</a><br>
<a href="book-Z-H-23.html#%_idx_3682">atomic operations supported in hardware</a><br>
<a href="book-Z-H-23.html#%_idx_3672">atomic requirement for <tt>test-and-set!</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2368"><tt>attach-tag</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2558">using Scheme data types</a><br>
<a href="book-Z-H-16.html#%_idx_2076"><tt>augend</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4846">automagically</a><br>
<a href="book-Z-H-28.html#%_idx_4808">automatic search</a>, 
<em>see also</em> search
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4860">history of</a><br>
<a href="book-Z-H-33.html#%_idx_5832">automatic storage allocation</a><br>
<a href="book-Z-H-10.html#%_idx_516"><tt>average</tt></a><br>
<a href="book-Z-H-12.html#%_idx_1128">average damping</a><br>
<a href="book-Z-H-12.html#%_idx_1160"><tt>average-damp</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3560"><tt>averager</tt> (constraint)</a><p>

<p><p>

<br>
<a href="book-Z-H-16.html#%_idx_2172">B-tree</a><br>
<a href="book-Z-H-35.html#%_idx_6282">backquote</a><br>
<a href="book-Z-H-28.html#%_idx_4852">backtracking</a>, 
<em>see also</em> nondeterministic computing
<br>
<a href="book-Z-H-24.html#%_idx_4166">Backus, John</a><br>
<a href="book-Z-H-33.html#%_idx_5948">Baker, Henry G., Jr.</a><br>
<a href="book-Z-H-16.html#%_idx_2164">balanced binary tree</a>, 
<em>see also</em> binary tree
<br>
<a href="book-Z-H-15.html#%_idx_1702">balanced mobile</a><br>
<a href="book-Z-H-20.html#%_idx_2848">bank account</a>, <a href="book-Z-H-21.html#%_idx_3124">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3626">exchanging balances</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2996">joint</a>, <a href="book-Z-H-20.html#%_idx_3026">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4176">joint, modeled with streams</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3588">joint, with concurrent access</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2912">password-protected</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3614">serialized</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4148">stream model</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3636">transferring money</a><br>
<a href="book-Z-H-23.html#%_idx_3710">barrier synchronization</a><br>
<a href="book-Z-H-25.html#%_idx_4188">Barth, John</a><br>
Basic
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1546">restrictions on compound data</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3570">weakness in handling compound objects</a><br>
<a href="book-Z-H-34.html#%_idx_6004">Batali, John Dean</a><br>
<a href="book-Z-H-20.html#%_idx_2874"><tt>begin</tt> (special form)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2878">implicit in consequent of <tt>cond</tt> and in procedure body</a><br>
<a href="book-Z-H-26.html#%_idx_4328"><tt>begin-actions</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4326"><tt>begin?</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1880"><tt>below</tt></a>, <a href="book-Z-H-15.html#%_idx_1976">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3880">Bertrand's Hypothesis</a><br>
<a href="book-Z-H-15.html#%_idx_1878"><tt>beside</tt></a>, <a href="book-Z-H-15.html#%_idx_1972">[2]</a><br>
<a href="book-Z-H-33.html#%_idx_5880">bignum</a><br>
binary numbers, addition of, <em>see</em> adder
<br>
<a href="book-Z-H-16.html#%_idx_2144">binary search</a><br>
<a href="book-Z-H-16.html#%_idx_2142">binary tree</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2166">balanced</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2188">converting a list to a</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2182">converting to a list</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2240">for Huffman encoding</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2150">represented with lists</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2138">sets represented as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3310">table structured as</a><br>
<a href="book-Z-H-10.html#%_idx_588">bind</a><br>
<a href="book-Z-H-21.html#%_idx_3042">binding</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4490">deep</a><br>
<a href="book-Z-H-11.html#%_idx_740">binomial coefficients</a><br>
<a href="book-Z-H-10.html#%_idx_572">black box</a><br>
<a href="book-Z-H-10.html#%_idx_612">block structure</a>, <a href="book-Z-H-26.html#%_idx_4600">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3112">in environment model</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5448">in query language</a><br>
<a href="book-Z-H-23.html#%_idx_3664">blocked process</a><br>
<a href="book-Z-H-10.html#%_idx_324">body of a procedure</a><br>
<a href="book-Z-H-9.html#%_idx_62">Bolt Beranek and Newman Inc.</a><br>
<a href="book-Z-H-22.html#%_idx_3492">Borning, Alan</a><br>
<a href="book-Z-H-15.html#%_idx_1788">Borodin, Alan</a><br>
<a href="book-Z-H-10.html#%_idx_584">bound variable</a><br>
<a href="book-Z-H-15.html#%_idx_1528">box-and-pointer notation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1560">end-of-list marker</a><br>
<a href="book-Z-H-31.html#%_idx_5506"><tt>branch</tt> (in register machine)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5740">simulating</a><br>
<a href="book-Z-H-10.html#%_idx_258">branch of a tree</a><br>
<a href="book-Z-H-32.html#%_idx_5744"><tt>branch-dest</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5826">breakpoint</a><br>
<a href="book-Z-H-33.html#%_idx_5980">broken heart</a><br>
<a href="book-Z-H-9.html#%_idx_18">bug</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_606">capturing a free variable</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_3020">order of assignments</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_3002">side effect with aliasing</a><br>
<a href="book-Z-H-29.html#%_idx_5254">bureaucracy</a><br>
<a href="book-Z-H-23.html#%_idx_3686">Buridan, Jean</a><br>
<a href="book-Z-H-23.html#%_idx_3666">busy-waiting</a><p>

<p><p>

<br>
C
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6520">compiling Scheme into</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6186">error handling</a>, 
<a href="book-Z-H-35.html#%_idx_6496">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_688">recursive procedures</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1550">restrictions on compound data</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6518">Scheme interpreter written in</a>, 
<a href="book-Z-H-35.html#%_idx_6522">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1588"><tt>ca<tt>...</tt>r</tt></a><br>
<a href="book-Z-H-23.html#%_idx_3594">cache-coherence protocols</a><br>
<a href="book-Z-H-15.html#%_idx_1586"><tt>cadr</tt></a><br>
<a href="book-Z-H-12.html#%_idx_1108">calculator, fixed points with</a><br>
<a href="book-Z-H-24.html#%_idx_3808">call-by-name argument passing</a>, 
<a href="book-Z-H-27.html#%_idx_4714">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3816">call-by-need argument passing</a>, 
<a href="book-Z-H-27.html#%_idx_4712">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3902">memoization and</a><br>
<a href="book-Z-H-22.html#%_idx_3398"><tt>call-each</tt></a><br>
<a href="book-Z-H-10.html#%_idx_286">cancer of the semicolon</a><br>
<a href="book-Z-H-18.html#%_idx_2770">canonical form, for polynomials</a><br>
<a href="book-Z-H-10.html#%_idx_604">capturing a free variable</a><br>
<a href="book-Z-H-14.html#%_idx_1324"><tt>car</tt> (primitive procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1454">axiom for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5896">implemented with vectors</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1580">as list operation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1334">origin of the name</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1462">procedural implementation of</a>, 
<a href="book-Z-H-14.html#%_idx_1470">[2]</a>, <a href="book-Z-H-22.html#%_idx_3206">[3]</a>, 
<a href="book-Z-H-22.html#%_idx_3212">[4]</a>, <a href="book-Z-H-27.html#%_idx_4776">[5]</a><br>
<a href="book-Z-H-11.html#%_idx_912">Carmichael numbers</a>, 
<a href="book-Z-H-11.html#%_idx_948">[2]</a><br>
case analysis
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4246">data-directed programming vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_350">general</a>, <em>see also</em> <tt>cond</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_426">with two cases (<tt>if</tt>)</a><br>
<a href="book-Z-H-15.html#%_idx_1590"><tt>cd<tt>...</tt>r</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1328"><tt>cdr</tt> (primitive procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1456">axiom for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5898">implemented with vectors</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1582">as list operation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1336">origin of the name</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1464">procedural implementation of</a>, 
<a href="book-Z-H-14.html#%_idx_1472">[2]</a>, <a href="book-Z-H-22.html#%_idx_3208">[3]</a>, 
<a href="book-Z-H-22.html#%_idx_3214">[4]</a>, <a href="book-Z-H-27.html#%_idx_4778">[5]</a><br>
<a href="book-Z-H-15.html#%_idx_1606"><tt>cdr</tt> down a list</a><br>
<a href="book-Z-H-23.html#%_idx_3662">cell, in serializer implementation</a><br>
<a href="book-Z-H-22.html#%_idx_3518"><tt>celsius-fahrenheit-converter</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3566">expression-oriented</a><br>
<a href="book-Z-H-14.html#%_idx_1518"><tt>center</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2942">Ces&agrave;ro, Ernesto</a><br>
<a href="book-Z-H-24.html#%_idx_4128"><tt>cesaro-stream</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2950"><tt>cesaro-test</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2932">Chaitin, Gregory</a><br>
<a href="book-Z-H-11.html#%_idx_810">Chandah-sutra</a><br>
change and sameness
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2988">meaning of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3182">shared data and</a><br>
changing money, <em>see</em> counting change
<br>
<a href="book-Z-H-9.html#%_idx_104">chaos in the Solar System</a><br>
<a href="book-Z-H-28.html#%_idx_4904">Chapman, David</a><br>
character strings
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5410">primitive procedures for</a>, 
<a href="book-Z-H-35.html#%_idx_6320">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2006">quotation of</a><br>
<a href="book-Z-H-16.html#%_idx_2218">character, ASCII encoding</a><br>
<a href="book-Z-H-28.html#%_idx_4872">Charniak, Eugene</a><br>
<a href="book-Z-H-24.html#%_idx_3878">Chebyshev, Pafnutii L'vovich</a><br>
<a href="book-Z-H-15.html#%_idx_1848">chess, eight-queens puzzle</a>, 
<a href="book-Z-H-28.html#%_idx_4944">[2]</a><br>
<a href="book-Z-H-34.html#%_idx_6002">chip implementation of Scheme</a>, 
<a href="book-Z-H-34.html#%_idx_6014">[2]</a><br>
<a href="book-Z-H-28.html#%_idx_4858">chronological backtracking</a><br>
<a href="book-Z-H-11.html#%_idx_750">Chu Shih-chieh</a><br>
<a href="book-Z-H-14.html#%_idx_1474">Church numerals</a><br>
<a href="book-Z-H-12.html#%_idx_1056">Church, Alonzo</a>, <a href="book-Z-H-14.html#%_idx_1476">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4562">Church-Turing thesis</a><br>
circuit
<br>
&nbsp;&nbsp;&nbsp;&nbsp;digital, <em>see</em> digital-circuit simulation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4030">modeled with streams</a>, 
<a href="book-Z-H-24.html#%_idx_4088">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5274">Clark, Keith L.</a><br>
<a href="book-Z-H-10.html#%_idx_362">clause, of a <tt>cond</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4402">additional syntax</a><br>
<a href="book-Z-H-26.html#%_idx_4378">Clinger, William</a>, 
<a href="book-Z-H-27.html#%_idx_4718">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5272">closed world assumption</a><br>
<a href="book-Z-H-13.html#%_idx_1266">closure</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1536">in abstract algebra</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1532">closure property of <tt>cons</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1860">closure property of picture-language operations</a>, <a href="book-Z-H-15.html#%_idx_1886">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1542">lack of in many languages</a><br>
<a href="book-Z-H-15.html#%_idx_1872">coal, bituminous</a><br>
code
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2216">ASCII</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2222">fixed-length</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;Huffman, <em>see</em> Huffman code
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2230">Morse</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2236">prefix</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2226">variable-length</a><br>
<a href="book-Z-H-35.html#%_idx_6242">code generator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6246">arguments of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6258">value of</a><br>
<a href="book-Z-H-18.html#%_idx_2706"><tt>coeff</tt></a>, <a href="book-Z-H-18.html#%_idx_2748">[2]</a><br>
<a href="book-Z-H-18.html#%_idx_2580">coercion</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2774">in algebraic manipulation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2718">in polynomial arithmetic</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2582">procedure</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2588">table</a><br>
<a href="book-Z-H-29.html#%_idx_5054">Colmerauer, Alain</a><br>
<a href="book-Z-H-10.html#%_idx_156">combination</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1162">combination as operator of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_474">compound expression as operator of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_244">evaluation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1048"><tt>lambda</tt> expression as operator of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1164">as operator of combination</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_252">as a tree</a><br>
<a href="book-Z-H-10.html#%_idx_124">combination, means of</a>, 
<em>see also</em> closure
<br>
<a href="book-Z-H-35.html#%_idx_6290">comma, used with backquote</a><br>
<a href="book-Z-H-15.html#%_idx_1836">comments in programs</a><br>
<a href="book-Z-H-9.html#%_idx_92">Common Lisp</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1600">treatment of <tt>nil</tt></a><br>
<a href="book-Z-H-33.html#%_idx_5962">compacting garbage collector</a><br>
compilation, <em>see</em> compiler
<br>
<a href="book-Z-H-35.html#%_idx_6244"><tt>compile</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6472"><tt>compile-and-go</tt></a>, 
<a href="book-Z-H-35.html#%_idx_6484">[2]</a><br>
<a href="book-Z-H-35.html#%_idx_6514"><tt>compile-and-run</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6346"><tt>compile-application</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6312"><tt>compile-assignment</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6314"><tt>compile-definition</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6324"><tt>compile-if</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6340"><tt>compile-lambda</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6292"><tt>compile-linkage</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6376"><tt>compile-proc-appl</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6350"><tt>compile-procedure-call</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6304"><tt>compile-quoted</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6302"><tt>compile-self-evaluating</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6328"><tt>compile-sequence</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6440">compile-time environment</a>, 
<a href="book-Z-H-35.html#%_idx_6450">[2]</a>, <a href="book-Z-H-35.html#%_idx_6452">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6464">open coding and</a><br>
<a href="book-Z-H-35.html#%_idx_6306"><tt>compile-variable</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6476"><tt>compiled-apply</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6336"><tt>compiled-procedure-entry</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6338"><tt>compiled-procedure-env</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6334"><tt>compiled-procedure?</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6194">compiler</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6210">interpreter vs.</a>, 
<a href="book-Z-H-35.html#%_idx_6492">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6356">tail recursion, stack allocation, and garbage-collection</a><br>
<a href="book-Z-H-35.html#%_idx_6224">compiler for Scheme</a>, 
<em>see also</em> code generator; compile-time environment; instruction sequence; linkage descriptor; target register
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6234">analyzing evaluator vs.</a>, 
<a href="book-Z-H-35.html#%_idx_6238">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6308">assignments</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;code generators, <em>see</em> <tt>compile-...</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6344">combinations</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6316">conditionals</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6310">definitions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6232">efficiency</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6404">example compilation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6226">explicit-control evaluator vs.</a>, 
<a href="book-Z-H-35.html#%_idx_6274">[2]</a>, <a href="book-Z-H-35.html#%_idx_6488">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6240">expression-syntax procedures</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6466">interfacing to evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6318">label generation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6330"><tt>lambda</tt> expressions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6428">lexical addressing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6278">linkage code</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6222">machine-operation use</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6486">monitoring performance (stack use) of compiled code</a>, <a href="book-Z-H-35.html#%_idx_6506">[2]</a>, 
<a href="book-Z-H-35.html#%_idx_6510">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6422">open coding of primitives</a>, 
<a href="book-Z-H-35.html#%_idx_6458">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6416">order of operand evaluation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6342">procedure applications</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6298">quotations</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6220">register use</a>, 
<a href="book-Z-H-35.html#%_idx_6228">[2]</a>, <a href="book-Z-H-35.html#%_idx_6372">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6468">running compiled code</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6448">scanning out internal definitions</a>, 
<a href="book-Z-H-35.html#%_idx_6456">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6296">self-evaluating expressions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6326">sequences of expressions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6262">stack usage</a>, 
<a href="book-Z-H-35.html#%_idx_6270">[2]</a>, <a href="book-Z-H-35.html#%_idx_6418">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6236">structure of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6352">tail-recursive code generated by</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6300">variables</a><br>
<a href="book-Z-H-18.html#%_idx_2538"><tt>complex</tt> package</a><br>
complex numbers
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2340">polar representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2320">rectangular representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2306">rectangular vs. polar form</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2356">represented as tagged data</a><br>
<a href="book-Z-H-18.html#%_idx_2630"><tt>complex-&gt;complex</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2300">complex-number arithmetic</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2540">interfaced to generic arithmetic system</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2418">structure of system</a><br>
<a href="book-Z-H-12.html#%_idx_1226">composition of functions</a><br>
<a href="book-Z-H-13.html#%_idx_1256">compound data, need for</a><br>
<a href="book-Z-H-10.html#%_idx_154">compound expression</a>, 
<em>see also</em> combination; special form
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_476">as operator of combination</a><br>
<a href="book-Z-H-10.html#%_idx_296">compound procedure</a>, 
<em>see also</em> procedure
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_332">used like primitive procedure</a><br>
<a href="book-Z-H-29.html#%_idx_5122">compound query</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5196">processing</a>, <a href="book-Z-H-29.html#%_idx_5316">[2]</a>, 
<a href="book-Z-H-29.html#%_idx_5422">[3]</a>, <a href="book-Z-H-29.html#%_idx_5430">[4]</a>, 
<a href="book-Z-H-29.html#%_idx_5436">[5]</a><br>
<a href="book-Z-H-34.html#%_idx_6080"><tt>compound-apply</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4446"><tt>compound-procedure?</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4554">computability</a>, <a href="book-Z-H-26.html#%_idx_4596">[2]</a><br>
<a href="book-Z-H-9.html#%_idx_8">computational process</a>, 
<em>see also</em> process
<br>
<a href="book-Z-H-25.html#%_idx_4200">computer science</a>, 
<a href="book-Z-H-26.html#%_idx_4558">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_498">mathematics vs.</a>, 
<a href="book-Z-H-29.html#%_idx_5036">[2]</a><br>
<a href="book-Z-H-14.html#%_idx_1286">concrete data representation</a><br>
<a href="book-Z-H-23.html#%_idx_3578">concurrency</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3600">correctness of concurrent programs</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3694">deadlock</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4162">functional programming and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3608">mechanisms for controlling</a><br>
<a href="book-Z-H-10.html#%_idx_352"><tt>cond</tt> (special form)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4400">additional clause syntax</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_364">clause</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_384">evaluation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_442"><tt>if</tt> vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2880">implicit <tt>begin</tt> in consequent</a><br>
<a href="book-Z-H-26.html#%_idx_4370"><tt>cond-&gt;if</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4368"><tt>cond-actions</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4362"><tt>cond-clauses</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4364"><tt>cond-else-clause?</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4366"><tt>cond-predicate</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4360"><tt>cond?</tt></a><br>
conditional expression
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_356"><tt>cond</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_424"><tt>if</tt></a><br>
<a href="book-Z-H-11.html#%_idx_888">congruent modulo <em>n</em></a><br>
<a href="book-Z-H-29.html#%_idx_5320"><tt>conjoin</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3530"><tt>connect</tt></a>, <a href="book-Z-H-22.html#%_idx_3558">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3516">connector(s), in constraint system</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3520">operations on</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3544">representing</a><br>
<a href="book-Z-H-28.html#%_idx_4882">Conniver</a><br>
<a href="book-Z-H-14.html#%_idx_1320"><tt>cons</tt> (primitive procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1452">axiom for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1534">closure property of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3158">implemented with mutators</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5904">implemented with vectors</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1592">as list operation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1332">meaning of the name</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1460">procedural implementation of</a>, 
<a href="book-Z-H-14.html#%_idx_1468">[2]</a>, <a href="book-Z-H-22.html#%_idx_3160">[3]</a>, 
<a href="book-Z-H-22.html#%_idx_3204">[4]</a>, <a href="book-Z-H-22.html#%_idx_3210">[5]</a>, 
<a href="book-Z-H-27.html#%_idx_4774">[6]</a><br>
<a href="book-Z-H-15.html#%_idx_1628"><tt>cons</tt> up a list</a><br>
<a href="book-Z-H-24.html#%_idx_3738"><tt>cons-stream</tt> (special form)</a>, 
<a href="book-Z-H-24.html#%_idx_3778">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4770">lazy evaluation and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3784">why a special form</a><br>
<a href="book-Z-H-26.html#%_idx_4262">consciousness, expansion of</a><br>
consequent
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_388">of <tt>cond</tt> clause</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_436">of <tt>if</tt></a><br>
<a href="book-Z-H-31.html#%_idx_5530"><tt>const</tt> (in register machine)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5772">simulating</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5618">syntax of</a><br>
<a href="book-Z-H-22.html#%_idx_3540"><tt>constant</tt> (primitive constraint)</a><br>
<a href="book-Z-H-31.html#%_idx_5620">constant, specifying in register machine</a><br>
<a href="book-Z-H-32.html#%_idx_5780"><tt>constant-exp</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5782"><tt>constant-exp-value</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3514">constraint network</a><br>
constraint(s)
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3512">primitive</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3484">propagation of</a><br>
<a href="book-Z-H-35.html#%_idx_6348"><tt>construct-arglist</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1292">constructor</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1382">as abstraction barrier</a><br>
<a href="book-Z-H-17.html#%_idx_2372"><tt>contents</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2562">using Scheme data types</a><br>
continuation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4984">in nondeterministic evaluator</a>, 
<a href="book-Z-H-28.html#%_idx_5000">[2]</a>, 
<em>see also</em> failure continuation; success continuation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5700">in register-machine simulator</a><br>
<a href="book-Z-H-31.html#%_idx_5554"><tt>continue</tt> register</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6024">in explicit-control evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5582">recursion and</a><br>
<a href="book-Z-H-12.html#%_idx_1138">continued fraction</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1146"><em>e</em> as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1140">golden ratio as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1152">tangent as</a><br>
<a href="book-Z-H-29.html#%_idx_5252">control structure</a><br>
<a href="book-Z-H-31.html#%_idx_5470">controller for register machine</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5488">controller diagram</a><br>
<a href="book-Z-H-13.html#%_idx_1268">conventional interface</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1720">sequence as</a><br>
<a href="book-Z-H-16.html#%_idx_2176">Cormen, Thomas H.</a><br>
<a href="book-Z-H-15.html#%_idx_1892"><tt>corner-split</tt></a><br>
<a href="book-Z-H-10.html#%_idx_500">correctness of a program</a><br>
<a href="book-Z-H-12.html#%_idx_1112"><tt>cos</tt> (primitive procedure)</a><br>
cosine
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1104">fixed point of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3916">power series for</a><br>
<a href="book-Z-H-11.html#%_idx_914">cosmic radiation</a><br>
<a href="book-Z-H-11.html#%_idx_730"><tt>count-change</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1682"><tt>count-leaves</tt></a>, 
<a href="book-Z-H-15.html#%_idx_1690">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1792">as accumulation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5924">as register machine</a><br>
<a href="book-Z-H-22.html#%_idx_3192"><tt>count-pairs</tt></a><br>
<a href="book-Z-H-11.html#%_idx_728">counting change</a>, <a href="book-Z-H-15.html#%_idx_1646">[2]</a><br>
<a href="book-Z-H-23.html#%_idx_3718">credit-card accounts, international</a><br>
<a href="book-Z-H-33.html#%_idx_5982">Cressey, David</a><br>
<a href="book-Z-H-18.html#%_idx_2574">cross-type operations</a><br>
<a href="book-Z-H-11.html#%_idx_920">cryptography</a><br>
<a href="book-Z-H-11.html#%_idx_788"><tt>cube</tt></a>, <a href="book-Z-H-12.html#%_idx_962">[2]</a>, 
<a href="book-Z-H-12.html#%_idx_1194">[3]</a><br>
cube root
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1172">as fixed point</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_560">by Newton's method</a><br>
<a href="book-Z-H-12.html#%_idx_1176"><tt>cube-root</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3450">current time, for simulation agenda</a><br>
<a href="book-Z-H-22.html#%_idx_3422"><tt>current-time</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3458">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3170">cycle in list</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3194">detecting</a><p>

<p><p>

<br>
<a href="book-Z-H-24.html#%_idx_4170">Darlington, John</a><br>
<a href="book-Z-H-9.html#%_idx_12">data</a>, <a href="book-Z-H-10.html#%_idx_130">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1284">abstract</a>, 
<em>see also</em> data abstraction
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1424">abstract models for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1440">algebraic specification for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-13.html#%_idx_1258">compound</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1288">concrete representation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1540">hierarchical</a>, 
<a href="book-Z-H-15.html#%_idx_1672">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1344">list-structured</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1414">meaning of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;mutable, <em>see</em> mutable data objects
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_134">numerical</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1446">procedural representation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4542">as program</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3176">shared</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_1984">symbolic</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2360">tagged</a>, <a href="book-Z-H-33.html#%_idx_5866">[2]</a><br>
<a href="book-Z-H-13.html#%_idx_1262">data abstraction</a>, 
<a href="book-Z-H-14.html#%_idx_1280">[2]</a>, <a href="book-Z-H-17.html#%_idx_2288">[3]</a>, 
<a href="book-Z-H-17.html#%_idx_2310">[4]</a>, <a href="book-Z-H-26.html#%_idx_4280">[5]</a>, 
<em>see also</em> metacircular evaluator
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3228">for queue</a><br>
data base
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2482">data-directed programming and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5190">indexing</a>, <a href="book-Z-H-29.html#%_idx_5374">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2484">Insatiable Enterprises personnel</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5098">logic programming and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5106">Microshaft personnel</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2202">as set of records</a><br>
<a href="book-Z-H-31.html#%_idx_5468">data paths for register machine</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5478">data-path diagram</a><br>
data types
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2552">in Lisp</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4098">in strongly typed languages</a><br>
<a href="book-Z-H-17.html#%_idx_2298">data-directed programming</a>, 
<a href="book-Z-H-17.html#%_idx_2424">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4244">case analysis vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4388">in metacircular evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5308">in query interpreter</a><br>
<a href="book-Z-H-18.html#%_idx_2720">data-directed recursion</a><br>
<a href="book-Z-H-23.html#%_idx_3696">deadlock</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3698">avoidance</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3700">recovery</a><br>
<a href="book-Z-H-9.html#%_idx_22">debug</a><br>
<a href="book-Z-H-10.html#%_idx_542">decimal point in numbers</a><br>
<a href="book-Z-H-10.html#%_idx_492">declarative vs. imperative knowledge</a>, 
<a href="book-Z-H-29.html#%_idx_5030">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5070">logic programming and</a>, 
<a href="book-Z-H-29.html#%_idx_5256">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4816">nondeterministic computing and</a><br>
<a href="book-Z-H-16.html#%_idx_2272"><tt>decode</tt></a><br>
<a href="book-Z-H-10.html#%_idx_568">decomposition of program into parts</a><br>
<a href="book-Z-H-26.html#%_idx_4488">deep binding</a><br>
<a href="book-Z-H-15.html#%_idx_1692"><tt>deep-reverse</tt></a><br>
<a href="book-Z-H-11.html#%_idx_652">deferred operations</a><br>
<a href="book-Z-H-10.html#%_idx_224"><tt>define</tt> (special form)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1650">with dotted-tail notation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3078">environment model of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1042"><tt>lambda</tt> vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_306">for procedures</a>, 
<a href="book-Z-H-12.html#%_idx_1046">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4300">syntactic sugar</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_228">value of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_270">why a special form</a><br>
<tt>define</tt> (special form)
<br>
&nbsp;&nbsp;&nbsp;&nbsp;internal, <em>see</em> internal definition
<br>
<a href="book-Z-H-26.html#%_idx_4460"><tt>define-variable!</tt></a>, 
<a href="book-Z-H-26.html#%_idx_4484">[2]</a><br>
<a href="book-Z-H-12.html#%_idx_1002">definite integral</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2960">estimated with Monte Carlo simulation</a>, <a href="book-Z-H-24.html#%_idx_4142">[2]</a><br>
definition, <em>see</em> <tt>define</tt>; internal definition
<br>
<a href="book-Z-H-26.html#%_idx_4306"><tt>definition-value</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4304"><tt>definition-variable</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4302"><tt>definition?</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4898">deKleer, Johan</a>, <a href="book-Z-H-29.html#%_idx_5264">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3768"><tt>delay</tt> (special form)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4072">explicit</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4798">explicit vs. automatic</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3796">implementation using <tt>lambda</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4768">lazy evaluation and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3800">memoized</a>, <a href="book-Z-H-24.html#%_idx_3900">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3786">why a special form</a><br>
<a href="book-Z-H-22.html#%_idx_3342">delay, in digital circuit</a><br>
<a href="book-Z-H-27.html#%_idx_4742"><tt>delay-it</tt></a><br>
<a href="book-Z-H-24.html#%_idx_4068">delayed argument</a><br>
<a href="book-Z-H-19.html#%_idx_2834">delayed evaluation</a>, 
<a href="book-Z-H-24.html#%_idx_3730">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3830">assignment and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4800">explicit vs. automatic</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4668">in lazy evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4094">normal-order evaluation and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3826">printing and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4056">streams and</a><br>
<a href="book-Z-H-24.html#%_idx_3772">delayed object</a><br>
<a href="book-Z-H-22.html#%_idx_3240"><tt>delete-queue!</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3258">[2]</a><br>
<a href="book-Z-H-14.html#%_idx_1304"><tt>denom</tt></a>, <a href="book-Z-H-14.html#%_idx_1352">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1420">axiom for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1394">reducing to lowest terms</a><br>
<a href="book-Z-H-18.html#%_idx_2726">dense polynomial</a><br>
<a href="book-Z-H-28.html#%_idx_4888">dependency-directed backtracking</a><br>
<a href="book-Z-H-23.html#%_idx_3632"><tt>deposit</tt> , with external serializer</a><br>
<a href="book-Z-H-20.html#%_idx_2898"><tt>deposit</tt> message for bank account</a><br>
<a href="book-Z-H-28.html#%_idx_4854">depth-first search</a><br>
<a href="book-Z-H-22.html#%_idx_3266">deque</a><br>
<a href="book-Z-H-12.html#%_idx_1192"><tt>deriv</tt> (numerical)</a><br>
<a href="book-Z-H-16.html#%_idx_2056"><tt>deriv</tt> (symbolic)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2480">data-directed</a><br>
<a href="book-Z-H-12.html#%_idx_1186">derivative of a function</a><br>
<a href="book-Z-H-26.html#%_idx_4356">derived expressions in evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6116">adding to explicit-control evaluator</a><br>
<a href="book-Z-H-15.html#%_idx_1980">design, stratified</a><br>
<a href="book-Z-H-24.html#%_idx_4062">differential equation</a>, 
<em>see also</em> <tt>solve</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4082">second-order</a>, 
<a href="book-Z-H-24.html#%_idx_4084">[2]</a><br>
differentiation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1190">numerical</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2048">rules for</a>, <a href="book-Z-H-16.html#%_idx_2094">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2042">symbolic</a>, <a href="book-Z-H-17.html#%_idx_2478">[2]</a><br>
<a href="book-Z-H-23.html#%_idx_3606">diffusion, simulation of</a><br>
<a href="book-Z-H-22.html#%_idx_3338">digital signal</a><br>
<a href="book-Z-H-22.html#%_idx_3328">digital-circuit simulation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3410">agenda</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3436">agenda implementation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3368">primitive function boxes</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3392">representing wires</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3428">sample simulation</a><br>
<a href="book-Z-H-23.html#%_idx_3658">Dijkstra, Edsger Wybe</a><br>
<a href="book-Z-H-28.html#%_idx_4932">Dinesman, Howard P.</a><br>
<a href="book-Z-H-11.html#%_idx_882">Diophantus's <em>Arithmetic</em>, Fermat's copy of</a><br>
<a href="book-Z-H-29.html#%_idx_5324"><tt>disjoin</tt></a><br>
dispatching
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2494">comparing different styles</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2430">on type</a>, 
<em>see also</em> data-directed programming
<br>
<a href="book-Z-H-11.html#%_idx_940"><tt>display</tt> (primitive procedure)</a>, 
<a href="book-Z-H-14.html#%_idx_1358">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3766"><tt>display-line</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3764"><tt>display-stream</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4934"><tt>distinct?</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2510"><tt>div</tt> (generic)</a><br>
<a href="book-Z-H-17.html#%_idx_2318"><tt>div-complex</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1500"><tt>div-interval</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1512">division by zero</a><br>
<a href="book-Z-H-18.html#%_idx_2760"><tt>div-poly</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1314"><tt>div-rat</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3938"><tt>div-series</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2762"><tt>div-terms</tt></a><br>
<a href="book-Z-H-11.html#%_idx_864"><tt>divides?</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3838"><tt>divisible?</tt></a><br>
<a href="book-Z-H-10.html#%_idx_532">division of integers</a><br>
<a href="book-Z-H-23.html#%_idx_3690">dog, perfectly rational, behavior of</a><br>
<a href="book-Z-H-34.html#%_idx_6190">DOS/Windows</a><br>
<a href="book-Z-H-15.html#%_idx_1802"><tt>dot-product</tt></a><br>
dotted-tail notation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1648">for procedure parameters</a>, 
<a href="book-Z-H-17.html#%_idx_2456">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5116">in query pattern</a>, 
<a href="book-Z-H-29.html#%_idx_5350">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5162">in query-language rule</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5354"><tt>read</tt> and</a><br>
<a href="book-Z-H-28.html#%_idx_4890">Doyle, Jon</a><br>
<a href="book-Z-H-15.html#%_idx_1948"><tt>draw-line</tt></a><br>
driver loop
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6136">in explicit-control evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4732">in lazy evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4518">in metacircular evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4908">in nondeterministic evaluator</a>, 
<a href="book-Z-H-28.html#%_idx_5018">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5232">in query interpreter</a>, 
<a href="book-Z-H-29.html#%_idx_5288">[2]</a><br>
<tt>driver-loop</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4736">for lazy evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4532">for metacircular evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_5024">for nondeterministic evaluator</a><p>

<p><p>

<br>
<em>e</em>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1148">as continued fraction</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4078">as solution to differential equation</a><br>
<a href="book-Z-H-24.html#%_idx_3914"><em>e</em><sup><em>x</em></sup>, power series for</a><br>
<a href="book-Z-H-24.html#%_idx_3848">Earth, measuring circumference of</a><br>
<a href="book-Z-H-15.html#%_idx_1918"><tt>edge1-frame</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1920"><tt>edge2-frame</tt></a><br>
efficiency, <em>see also</em> order of growth, 
<em>see also</em> order of growth
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6230">of compilation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5188">of data-base access</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4642">of evaluation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_100">of Lisp</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5202">of query processing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_732">of tree-recursive process</a><br>
<a href="book-Z-H-23.html#%_idx_3716">EIEIO</a><br>
<a href="book-Z-H-15.html#%_idx_1846">eight-queens puzzle</a>, 
<a href="book-Z-H-28.html#%_idx_4946">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_4032">electrical circuits, modeled with streams</a>, <a href="book-Z-H-24.html#%_idx_4090">[2]</a><br>
<a href="book-Z-H-16.html#%_idx_2104"><tt>element-of-set?</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2160">binary-tree representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2128">ordered-list representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2116">unordered-list representation</a><br>
<a href="book-Z-H-10.html#%_idx_416"><tt>else</tt> (special symbol in <tt>cond</tt>)</a><br>
<a href="book-Z-H-27.html#%_idx_4672">embedded language, language design using</a><br>
<a href="book-Z-H-15.html#%_idx_1594">empty list</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2018">denoted as <tt>'()</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1618">recognizing with <tt>null?</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3744">empty stream</a><br>
<a href="book-Z-H-22.html#%_idx_3414"><tt>empty-agenda?</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3470">[2]</a><br>
<a href="book-Z-H-34.html#%_idx_6060"><tt>empty-arglist</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6268"><tt>empty-instruction-sequence</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3234"><tt>empty-queue?</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3250">[2]</a><br>
<a href="book-Z-H-18.html#%_idx_2696"><tt>empty-termlist?</tt></a>, 
<a href="book-Z-H-18.html#%_idx_2742">[2]</a><br>
<a href="book-Z-H-20.html#%_idx_2886">encapsulated name</a><br>
<a href="book-Z-H-21.html#%_idx_3044">enclosing environment</a><br>
<a href="book-Z-H-26.html#%_idx_4466"><tt>enclosing-environment</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2278"><tt>encode</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1564">end-of-list marker</a><br>
<a href="book-Z-H-14.html#%_idx_1402"><tt>end-segment</tt></a>, 
<a href="book-Z-H-15.html#%_idx_1958">[2]</a><br>
<a href="book-Z-H-35.html#%_idx_6294"><tt>end-with-linkage</tt></a><br>
<a href="book-Z-H-11.html#%_idx_916">engineering vs. mathematics</a><br>
<a href="book-Z-H-16.html#%_idx_2152"><tt>entry</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1744"><tt>enumerate-interval</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1750"><tt>enumerate-tree</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1730">enumerator</a><br>
<a href="book-Z-H-34.html#%_idx_6020"><tt>env</tt> register</a><br>
<a href="book-Z-H-10.html#%_idx_240">environment</a>, <a href="book-Z-H-21.html#%_idx_3038">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;compile-time, <em>see</em> compile-time environment
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_268">as context for evaluation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3046">enclosing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;global, <em>see</em> global environment
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_622">lexical scoping and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5450">in query interpreter</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5444">renaming vs.</a><br>
<a href="book-Z-H-19.html#%_idx_2832">environment model of evaluation</a>, 
<a href="book-Z-H-21.html#%_idx_3034">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3058">environment structure</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3114">internal definitions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3102">local state</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3120">message passing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4216">metacircular evaluator and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3082">procedure-application example</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3064">rules for evaluation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3094">tail recursion and</a><br>
<a href="book-Z-H-16.html#%_idx_2026"><tt>eq?</tt> (primitive procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3188">for arbitrary objects</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3186">as equality of pointers</a>, 
<a href="book-Z-H-33.html#%_idx_5868">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5884">implementation for symbols</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5874">numerical equality and</a><br>
<a href="book-Z-H-18.html#%_idx_2564"><tt>equ?</tt> (generic predicate)</a><br>
<a href="book-Z-H-14.html#%_idx_1316"><tt>equal-rat?</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2032"><tt>equal?</tt></a><br>
equality
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2566">in generic arithmetic system</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2034">of lists</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_408">of numbers</a>, <a href="book-Z-H-16.html#%_idx_2040">[2]</a>, 
<a href="book-Z-H-33.html#%_idx_5876">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2994">referential transparency and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2022">of symbols</a><br>
equation, solving, <em>see</em> half-interval method; Newton's method; <tt>solve</tt>
<br>
<a href="book-Z-H-24.html#%_idx_3846">Eratosthenes</a><br>
<a href="book-Z-H-12.html#%_idx_1088"><tt>error</tt> (primitive procedure)</a><br>
error handling
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6494">in compiled code</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6148">in explicit-control evaluator</a>, 
<a href="book-Z-H-34.html#%_idx_6182">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1858">Escher, Maurits Cornelis</a><br>
<a href="book-Z-H-20.html#%_idx_2962"><tt>estimate-integral</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2948"><tt>estimate-pi</tt></a>, 
<a href="book-Z-H-20.html#%_idx_2954">[2]</a><br>
<a href="book-Z-H-11.html#%_idx_836">Euclid's Algorithm</a>, 
<a href="book-Z-H-31.html#%_idx_5476">[2]</a>, 
<em>see also</em> greatest common divisor
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_844">order of growth</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2786">for polynomials</a><br>
<a href="book-Z-H-11.html#%_idx_838">Euclid's <em>Elements</em></a><br>
<a href="book-Z-H-24.html#%_idx_3876">Euclid's proof of infinite number of primes</a><br>
<a href="book-Z-H-18.html#%_idx_2790">Euclidean ring</a><br>
<a href="book-Z-H-12.html#%_idx_1144">Euler, Leonhard</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_878">proof of Fermat's Little Theorem</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3968">series accelerator</a><br>
<a href="book-Z-H-24.html#%_idx_3970"><tt>euler-transform</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6056"><tt>ev-application</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6110"><tt>ev-assignment</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6084"><tt>ev-begin</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6114"><tt>ev-definition</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6106"><tt>ev-if</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6044"><tt>ev-lambda</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6042"><tt>ev-quoted</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6038"><tt>ev-self-eval</tt></a><br>
<tt>ev-sequence</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6086">with tail recursion</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6100">without tail recursion</a><br>
<a href="book-Z-H-34.html#%_idx_6040"><tt>ev-variable</tt></a><br>
<a href="book-Z-H-27.html#%_idx_4720"><tt>eval</tt> (lazy)</a><br>
<a href="book-Z-H-26.html#%_idx_4230"><tt>eval</tt> (metacircular)</a>, 
<a href="book-Z-H-26.html#%_idx_4242">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4654">analyzing version</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4392">data-directed</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4576">primitive <tt>eval</tt> vs.</a><br>
<a href="book-Z-H-26.html#%_idx_4572"><tt>eval</tt> (primitive procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4584">MIT Scheme</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5334">used in query interpreter</a><br>
<a href="book-Z-H-26.html#%_idx_4266"><tt>eval-assignment</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4268"><tt>eval-definition</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6034"><tt>eval-dispatch</tt></a><br>
<a href="book-Z-H-27.html#%_idx_4730"><tt>eval-if</tt> (lazy)</a><br>
<a href="book-Z-H-26.html#%_idx_4258"><tt>eval-if</tt> (metacircular)</a><br>
<a href="book-Z-H-26.html#%_idx_4264"><tt>eval-sequence</tt></a><br>
evaluation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;applicative-order, <em>see</em> applicative-order evaluation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;delayed, <em>see</em> delayed evaluation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;environment model of, <em>see</em> environment model of evaluation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6132">models of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;normal-order, <em>see</em> normal-order evaluation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_246">of a combination</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_452">of <tt>and</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_386">of <tt>cond</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_430">of <tt>if</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_460">of <tt>or</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_266">of primitive expressions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_274">of special forms</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;order of subexpression evaluation, <em>see</em> order of evaluation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;substitution model of, <em>see</em> substitution model of procedure application
<br>
<a href="book-Z-H-25.html#%_idx_4198">evaluator</a>, <em>see also</em> interpreter
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4548">as abstract machine</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4214">metacircular</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4550">as universal machine</a><br>
evaluators, <em>see</em> metacircular evaluator; analyzing evaluator; lazy evaluator; nondeterministic evaluator; query interpreter; explicit-control evaluator
<br>
<a href="book-Z-H-15.html#%_idx_1724"><tt>even-fibs</tt></a>, <a href="book-Z-H-15.html#%_idx_1754">[2]</a><br>
<a href="book-Z-H-11.html#%_idx_804"><tt>even?</tt></a><br>
evening star, <em>see</em> Venus
<br>
<a href="book-Z-H-22.html#%_idx_3330">event-driven simulation</a><br>
<a href="book-Z-H-34.html#%_idx_6066">evlis tail recursion</a><br>
<a href="book-Z-H-10.html#%_idx_528">exact integer</a><br>
<a href="book-Z-H-23.html#%_idx_3628"><tt>exchange</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2870">exclamation point in names</a><br>
<a href="book-Z-H-32.html#%_idx_5670"><tt>execute</tt></a><br>
<tt>execute-application</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4660">metacircular</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_5012">nondeterministic</a><br>
execution procedure
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4652">in analyzing evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4982">in nondeterministic evaluator</a>, 
<a href="book-Z-H-28.html#%_idx_4986">[2]</a>, <a href="book-Z-H-28.html#%_idx_5002">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5668">in register-machine simulator</a>, 
<a href="book-Z-H-32.html#%_idx_5716">[2]</a><br>
<a href="book-Z-H-34.html#%_idx_6018"><tt>exp</tt> register</a><br>
<a href="book-Z-H-26.html#%_idx_4372"><tt>expand-clauses</tt></a><br>
<a href="book-Z-H-34.html#%_idx_5996">explicit-control evaluator for Scheme</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6108">assignments</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6048">combinations</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6078">compound procedures</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6104">conditionals</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6032">controller</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6006">data paths</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6112">definitions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6118">derived expressions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6134">driver loop</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6150">error handling</a>, 
<a href="book-Z-H-34.html#%_idx_6184">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6036">expressions with no subexpressions to evaluate</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6208">as machine-language program</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6158">machine model</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6470">modified for compiled code</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6160">monitoring performance (stack use)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6124">normal-order evaluation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6058">operand evaluation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6008">operations</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6276">optimizations (additional)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6074">primitive procedures</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6046">procedure application</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6016">registers</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6128">running</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6082">sequences of expressions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6120">special forms (additional)</a>, 
<a href="book-Z-H-34.html#%_idx_6122">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6050">stack usage</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6088">tail recursion</a>, 
<a href="book-Z-H-34.html#%_idx_6166">[2]</a>, <a href="book-Z-H-34.html#%_idx_6174">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6198">as universal machine</a><br>
<a href="book-Z-H-11.html#%_idx_898"><tt>expmod</tt></a>, <a href="book-Z-H-11.html#%_idx_944">[2]</a>, 
<a href="book-Z-H-11.html#%_idx_946">[3]</a><br>
<a href="book-Z-H-11.html#%_idx_782">exponential growth</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_722">of tree-recursive Fibonacci-number computation</a><br>
<a href="book-Z-H-11.html#%_idx_790">exponentiation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_896">modulo <em>n</em></a><br>
expression, <em>see also</em> compound expression; primitive expression
<br>
&nbsp;&nbsp;&nbsp;&nbsp;algebraic, <em>see</em> algebraic expressions
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4238">self-evaluating</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-13.html#%_idx_1272">symbolic</a>, 
<em>see also</em> symbol(s)
<br>
<a href="book-Z-H-22.html#%_idx_3574">expression-oriented vs. imperative programming style</a><br>
<tt>expt</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_794">linear iterative version</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_792">linear recursive version</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5590">register machine for</a><br>
<a href="book-Z-H-26.html#%_idx_4458"><tt>extend-environment</tt></a>, 
<a href="book-Z-H-26.html#%_idx_4478">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5348"><tt>extend-if-consistent</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5370"><tt>extend-if-possible</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6482"><tt>external-entry</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5688"><tt>extract-labels</tt></a>, 
<a href="book-Z-H-32.html#%_idx_5692">[2]</a><p>

<p><p>

<br>
<a href="book-Z-H-10.html#%_idx_380"><tt>#f</tt></a><br>
<a href="book-Z-H-11.html#%_idx_640">factorial</a>, 
<em>see also</em> <tt>factorial</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3890">infinite stream</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4622">with <tt>letrec</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4626">without <tt>letrec</tt> or <tt>define</tt></a><br>
<tt>factorial</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4546">as an abstract machine</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6406">compilation of</a>, 
<a href="book-Z-H-35.html#%_idx_6412">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3088">environment structure in evaluating</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_646">linear iterative version</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_642">linear recursive version</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5490">register machine for (iterative)</a>, 
<a href="book-Z-H-31.html#%_idx_5532">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5572">register machine for (recursive)</a>, 
<a href="book-Z-H-31.html#%_idx_5586">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6508">stack usage, compiled</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6170">stack usage, interpreted</a>, 
<a href="book-Z-H-34.html#%_idx_6172">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5814">stack usage, register machine</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_3018">with assignment</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1012">with higher-order procedures</a><br>
<a href="book-Z-H-28.html#%_idx_4990">failure continuation (nondeterministic evaluator)</a>, <a href="book-Z-H-28.html#%_idx_4998">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_5014">constructed by <tt>amb</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_5008">constructed by assignment</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_5020">constructed by driver loop</a><br>
<a href="book-Z-H-28.html#%_idx_4826">failure, in nondeterministic computation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_5006">bug vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4840">searching and</a><br>
<a href="book-Z-H-10.html#%_idx_370">false</a><br>
<a href="book-Z-H-10.html#%_idx_382"><tt>false</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4436"><tt>false?</tt></a><br>
<a href="book-Z-H-11.html#%_idx_798"><tt>fast-expt</tt></a><br>
<a href="book-Z-H-11.html#%_idx_906"><tt>fast-prime?</tt></a><br>
<a href="book-Z-H-24.html#%_idx_4058">feedback loop, modeled with streams</a><br>
<a href="book-Z-H-26.html#%_idx_4648">Feeley, Marc</a><br>
<a href="book-Z-H-29.html#%_idx_5086">Feigenbaum, Edward</a><br>
<a href="book-Z-H-33.html#%_idx_5942">Fenichel, Robert</a><br>
<a href="book-Z-H-11.html#%_idx_872">Fermat, Pierre de</a><br>
<a href="book-Z-H-11.html#%_idx_868">Fermat test for primality</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_952">variant of</a><br>
<a href="book-Z-H-11.html#%_idx_886">Fermat's Little Theorem</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_960">alternate form</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_876">proof</a><br>
<a href="book-Z-H-11.html#%_idx_904"><tt>fermat-test</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5378"><tt>fetch-assertions</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5380"><tt>fetch-rules</tt></a><br>
<tt>fib</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_726">linear iterative version</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_828">logarithmic version</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5584">register machine for (tree-recursive)</a>, <a href="book-Z-H-31.html#%_idx_5588">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6512">stack usage, compiled</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6178">stack usage, interpreted</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_720">tree-recursive version</a>, 
<a href="book-Z-H-34.html#%_idx_6180">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3322">with memoization</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4422">with named <tt>let</tt></a><br>
<a href="book-Z-H-11.html#%_idx_718">Fibonacci numbers</a>, 
<em>see also</em> <tt>fib</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_846">Euclid's GCD algorithm and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;infinite stream of, <em>see</em> <tt>fibs</tt>
<br>
<a href="book-Z-H-24.html#%_idx_3840"><tt>fibs</tt> (infinite stream)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3868">implicit definition</a><br>
<a href="book-Z-H-22.html#%_idx_3226">FIFO buffer</a><br>
<a href="book-Z-H-12.html#%_idx_1026">filter</a>, <a href="book-Z-H-15.html#%_idx_1732">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1740"><tt>filter</tt></a><br>
<a href="book-Z-H-12.html#%_idx_1024"><tt>filtered-accumulate</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5344"><tt>find-assertions</tt></a><br>
<a href="book-Z-H-11.html#%_idx_862"><tt>find-divisor</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3416"><tt>first-agenda-item</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3480">[2]</a><br>
<a href="book-Z-H-12.html#%_idx_1218">first-class elements in language</a><br>
<a href="book-Z-H-26.html#%_idx_4332"><tt>first-exp</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4468"><tt>first-frame</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4348"><tt>first-operand</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3466"><tt>first-segment</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2698"><tt>first-term</tt></a>, 
<a href="book-Z-H-18.html#%_idx_2738">[2]</a><br>
<a href="book-Z-H-12.html#%_idx_1096">fixed point</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1106">computing with calculator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1102">of cosine</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1174">cube root as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1240">fourth root as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1132">golden ratio as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1252">as iterative improvement</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1180">in Newton's method</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1244"><em>n</em>th root as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1120">square root as</a>, 
<a href="book-Z-H-12.html#%_idx_1168">[2]</a>, <a href="book-Z-H-12.html#%_idx_1208">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1204">of transformed function</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5366">unification and</a><br>
<a href="book-Z-H-16.html#%_idx_2220">fixed-length code</a><br>
<a href="book-Z-H-12.html#%_idx_1100"><tt>fixed-point</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1250">as iterative improvement</a><br>
<a href="book-Z-H-12.html#%_idx_1206"><tt>fixed-point-of-transform</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5660"><tt>flag</tt> register</a><br>
<a href="book-Z-H-15.html#%_idx_1826"><tt>flatmap</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5392"><tt>flatten-stream</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1884"><tt>flip-horiz</tt></a>, 
<a href="book-Z-H-15.html#%_idx_1974">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1882"><tt>flip-vert</tt></a>, <a href="book-Z-H-15.html#%_idx_1964">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1888"><tt>flipped-pairs</tt></a>, 
<a href="book-Z-H-15.html#%_idx_1902">[2]</a>, <a href="book-Z-H-15.html#%_idx_1904">[3]</a><br>
<a href="book-Z-H-28.html#%_idx_4862">Floyd, Robert</a><br>
<a href="book-Z-H-15.html#%_idx_1814"><tt>fold-left</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1812"><tt>fold-right</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1670"><tt>for-each</tt></a>, <a href="book-Z-H-27.html#%_idx_4750">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3548"><tt>for-each-except</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4896">Forbus, Kenneth D.</a><br>
<a href="book-Z-H-24.html#%_idx_3774"><tt>force</tt></a>, <a href="book-Z-H-24.html#%_idx_3798">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4708">forcing a thunk vs.</a><br>
<a href="book-Z-H-27.html#%_idx_4704">force a thunk</a><br>
<a href="book-Z-H-27.html#%_idx_4740"><tt>force-it</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4748">memoized version</a><br>
<a href="book-Z-H-22.html#%_idx_3528"><tt>forget-value!</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3556">[2]</a><br>
<a href="book-Z-H-10.html#%_idx_320">formal parameters</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_580">names of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_598">scope of</a><br>
<a href="book-Z-H-10.html#%_idx_200">formatting input expressions</a><br>
<a href="book-Z-H-9.html#%_idx_40">Fortran</a>, <a href="book-Z-H-15.html#%_idx_1762">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4168">inventor of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1544">restrictions on compound data</a><br>
<a href="book-Z-H-33.html#%_idx_5988">forwarding address</a><br>
<a href="book-Z-H-12.html#%_idx_1238">fourth root, as fixed point</a><br>
fraction, <em>see</em> rational number(s)
<br>
<a href="book-Z-H-21.html#%_idx_3040">frame (environment model)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3098">as repository of local state</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3050">global</a><br>
<a href="book-Z-H-15.html#%_idx_1864">frame (picture language)</a>, 
<a href="book-Z-H-15.html#%_idx_1910">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1924">coordinate map</a><br>
<a href="book-Z-H-29.html#%_idx_5180">frame (query interpreter)</a>, 
<em>see also</em> pattern matching; unification
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5416">representation</a><br>
<a href="book-Z-H-15.html#%_idx_1926"><tt>frame-coord-map</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4474"><tt>frame-values</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4472"><tt>frame-variables</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6052">framed-stack discipline</a><br>
<a href="book-Z-H-9.html#%_idx_74">Franz Lisp</a><br>
<a href="book-Z-H-33.html#%_idx_5906"><tt>free</tt> register</a>, 
<a href="book-Z-H-33.html#%_idx_5976">[2]</a><br>
<a href="book-Z-H-33.html#%_idx_5908">free list</a><br>
<a href="book-Z-H-10.html#%_idx_590">free variable</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_608">capturing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_618">in internal definition</a><br>
<a href="book-Z-H-24.html#%_idx_3812">Friedman, Daniel P.</a>, 
<a href="book-Z-H-25.html#%_idx_4204">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1696"><tt>fringe</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1746">as a tree enumeration</a><br>
<a href="book-Z-H-22.html#%_idx_3242"><tt>front-ptr</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3236"><tt>front-queue</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3254">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3362">full-adder</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3366"><tt>full-adder</tt></a><br>
function (mathematical)
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1124"> <img src="book-Z-G-D-17.gif" border="0">   notation for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_710">Ackermann's</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1228">composition of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1188">derivative of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1098">fixed point of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_490">procedure vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2778">rational</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1230">repeated application of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1232">smoothing of</a><br>
<a href="book-Z-H-22.html#%_idx_3340">function box, in digital circuit</a><br>
<a href="book-Z-H-20.html#%_idx_2978">functional programming</a>, 
<a href="book-Z-H-24.html#%_idx_4118">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4164">concurrency and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4160">functional programming languages</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4146">time and</a><p>

<p><p>

<br>
<a href="book-Z-H-26.html#%_idx_4632">Gabriel, Richard P.</a><br>
<a href="book-Z-H-33.html#%_idx_5930">garbage collection</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4744">memoization and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3156">mutation and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6360">tail recursion and</a><br>
garbage collector
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5964">compacting</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5958">mark-sweep</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5934">stop-and-copy</a><br>
GCD, <em>see</em> greatest common divisor
<br>
<a href="book-Z-H-11.html#%_idx_842"><tt>gcd</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5474">register machine for</a>, 
<a href="book-Z-H-32.html#%_idx_5634">[2]</a><br>
<a href="book-Z-H-18.html#%_idx_2794"><tt>gcd-terms</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6202">general-purpose computer, as universal machine</a><br>
<a href="book-Z-H-16.html#%_idx_2280"><tt>generate-huffman-tree</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4976">generating sentences</a><br>
<a href="book-Z-H-18.html#%_idx_2502">generic arithmetic operations</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2500">structure of system</a><br>
<a href="book-Z-H-13.html#%_idx_1274">generic operation</a><br>
<a href="book-Z-H-16.html#%_idx_2268">generic procedure</a>, 
<a href="book-Z-H-17.html#%_idx_2292">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2404">generic selector</a>, 
<a href="book-Z-H-17.html#%_idx_2422">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5170">Genesis</a><br>
<a href="book-Z-H-17.html#%_idx_2440"><tt>get</tt></a>, <a href="book-Z-H-22.html#%_idx_3300">[2]</a><br>
<a href="book-Z-H-32.html#%_idx_5644"><tt>get-contents</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6140"><tt>get-global-environment</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5680"><tt>get-register</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5630"><tt>get-register-contents</tt></a>, 
<a href="book-Z-H-32.html#%_idx_5676">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3370"><tt>get-signal</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3404">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3524"><tt>get-value</tt></a>, <a href="book-Z-H-22.html#%_idx_3552">[2]</a><br>
<a href="book-Z-H-9.html#%_idx_20">glitch</a><br>
<a href="book-Z-H-10.html#%_idx_242">global environment</a>, 
<a href="book-Z-H-21.html#%_idx_3062">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4498">in metacircular evaluator</a><br>
<a href="book-Z-H-21.html#%_idx_3048">global frame</a><br>
<a href="book-Z-H-14.html#%_idx_1430">Goguen, Joseph</a><br>
<a href="book-Z-H-11.html#%_idx_724">golden ratio</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1142">as continued fraction</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1130">as fixed point</a><br>
<a href="book-Z-H-24.html#%_idx_4108">Gordon, Michael</a><br>
<a href="book-Z-H-31.html#%_idx_5514"><tt>goto</tt> (in register machine)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5558">label as destination</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5746">simulating</a><br>
<a href="book-Z-H-32.html#%_idx_5750"><tt>goto-dest</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4962">grammar</a><br>
graphics, <em>see</em> picture language
<br>
<a href="book-Z-H-23.html#%_idx_3704">Gray, Jim</a><br>
<a href="book-Z-H-11.html#%_idx_834">greatest common divisor</a>, 
<em>see also</em> <tt>gcd</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2798">generic</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2782">of polynomials</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2946">used to estimate <img src="book-Z-G-D-9.gif" border="0"> </a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1376">used in rational-number arithmetic</a><br>
<a href="book-Z-H-29.html#%_idx_5050">Green, Cordell</a><br>
<a href="book-Z-H-9.html#%_idx_72">Griss, Martin Lewis</a><br>
<a href="book-Z-H-14.html#%_idx_1438">Guttag, John Vogel</a><p>

<p><p>

<br>
<a href="book-Z-H-22.html#%_idx_3354">half-adder</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3360"><tt>half-adder</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3430">simulation of</a><br>
<a href="book-Z-H-12.html#%_idx_1082">half-interval method</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1092"><tt>half-interval-method</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1184">Newton's method vs.</a><br>
<a href="book-Z-H-26.html#%_idx_4588">halting problem</a><br>
<a href="book-Z-H-26.html#%_idx_4592">Halting Theorem</a><br>
<a href="book-Z-H-16.html#%_idx_2248">Hamming, Richard Wesley</a>, 
<a href="book-Z-H-24.html#%_idx_3894">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4382">Hanson, Christopher P.</a>, 
<a href="book-Z-H-35.html#%_idx_6364">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3882">Hardy, Godfrey Harold</a>, 
<a href="book-Z-H-24.html#%_idx_4012">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3522"><tt>has-value?</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3550">[2]</a><br>
<a href="book-Z-H-27.html#%_idx_4690">Hassle</a><br>
<a href="book-Z-H-23.html#%_idx_3702">Havender, J.</a><br>
<a href="book-Z-H-25.html#%_idx_4208">Haynes, Christopher T.</a><br>
<a href="book-Z-H-22.html#%_idx_3276">headed list</a>, <a href="book-Z-H-22.html#%_idx_3452">[2]</a><br>
<a href="book-Z-H-9.html#%_idx_70">Hearn, Anthony C.</a><br>
<a href="book-Z-H-15.html#%_idx_1856">Henderson, Peter</a>, 
<a href="book-Z-H-24.html#%_idx_3858">[2]</a>, <a href="book-Z-H-24.html#%_idx_4172">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3856">Henderson diagram</a><br>
<a href="book-Z-H-19.html#%_idx_2820">Heraclitus</a><br>
<a href="book-Z-H-10.html#%_idx_512">Heron of Alexandria</a><br>
<a href="book-Z-H-11.html#%_idx_698">Hewitt, Carl Eddie</a>, 
<a href="book-Z-H-28.html#%_idx_4864">[2]</a>, <a href="book-Z-H-29.html#%_idx_5052">[3]</a>, 
<a href="book-Z-H-33.html#%_idx_5950">[4]</a><br>
<a href="book-Z-H-20.html#%_idx_2890">hiding principle</a><br>
<a href="book-Z-H-15.html#%_idx_1538">hierarchical data structures</a>, 
<a href="book-Z-H-15.html#%_idx_1674">[2]</a><br>
<a href="book-Z-H-18.html#%_idx_2594">hierarchy of types</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2764">in symbolic algebra</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2614">inadequacy of</a><br>
<a href="book-Z-H-25.html#%_idx_4190">high-level language, machine language vs.</a><br>
<a href="book-Z-H-12.html#%_idx_964">higher-order procedures</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4254">in metacircular evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_966">procedure as argument</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1078">procedure as general method</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1156">procedure as returned value</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4096">strong typing and</a><br>
<a href="book-Z-H-16.html#%_idx_2198">Hilfinger, Paul</a><br>
<a href="book-Z-H-14.html#%_idx_1422">Hoare, Charles Antony Richard</a><br>
<a href="book-Z-H-26.html#%_idx_4566">Hodges, Andrew</a><br>
<a href="book-Z-H-26.html#%_idx_4570">Hofstadter, Douglas R.</a><br>
<a href="book-Z-H-15.html#%_idx_1778">Horner, W. G.</a><br>
<a href="book-Z-H-15.html#%_idx_1774">Horner's rule</a><br>
``how to'' vs. ``what is'' description, <em>see</em> imperative vs. declarative knowledge
<br>
<a href="book-Z-H-16.html#%_idx_2212">Huffman code</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2246">optimality of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2284">order of growth of encoding</a><br>
<a href="book-Z-H-16.html#%_idx_2238">Huffman, David</a><br>
<a href="book-Z-H-27.html#%_idx_4792">Hughes, R. J. M.</a><p>

<p><p>

<br>
<a href="book-Z-H-14.html#%_idx_1338">IBM 704</a><br>
<a href="book-Z-H-12.html#%_idx_996"><tt>identity</tt></a><br>
<a href="book-Z-H-10.html#%_idx_420"><tt>if</tt> (special form)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_440"><tt>cond</tt> vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_428">evaluation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_486">normal-order evaluation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3474">one-armed (without alternative)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_432">predicate, consequent, and alternative of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_556">why a special form</a><br>
<a href="book-Z-H-26.html#%_idx_4322"><tt>if-alternative</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4320"><tt>if-consequent</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4318"><tt>if-predicate</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4316"><tt>if?</tt></a><br>
<tt>imag-part</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2466">data-directed</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2346">polar representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2330">rectangular representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2408">with tagged data</a><br>
<a href="book-Z-H-17.html#%_idx_2392"><tt>imag-part-polar</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2380"><tt>imag-part-rectangular</tt></a><br>
<a href="book-Z-H-20.html#%_idx_3014">imperative programming</a><br>
<a href="book-Z-H-10.html#%_idx_494">imperative vs. declarative knowledge</a>, 
<a href="book-Z-H-29.html#%_idx_5032">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5072">logic programming and</a>, 
<a href="book-Z-H-29.html#%_idx_5258">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4818">nondeterministic computing and</a><br>
<a href="book-Z-H-22.html#%_idx_3576">imperative vs. expression-oriented programming style</a><br>
implementation dependencies, <em>see also</em> unspecified values
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_546">numbers</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3068">order of subexpression evaluation</a><br>
<a href="book-Z-H-12.html#%_idx_992"><tt>inc</tt></a><br>
<a href="book-Z-H-10.html#%_idx_234">incremental development of programs</a><br>
<a href="book-Z-H-18.html#%_idx_2654">indeterminate of a polynomial</a><br>
<a href="book-Z-H-29.html#%_idx_5192">indexing a data base</a>, 
<a href="book-Z-H-29.html#%_idx_5376">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5248">inference, method of</a><br>
<a href="book-Z-H-29.html#%_idx_5368">infinite series</a><br>
<a href="book-Z-H-24.html#%_idx_3832">infinite stream(s)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3896">merging</a>, <a href="book-Z-H-24.html#%_idx_3992">[2]</a>, 
<a href="book-Z-H-24.html#%_idx_4006">[3]</a>, <a href="book-Z-H-24.html#%_idx_4178">[4]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4182">merging as a relation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3888">of factorials</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;of Fibonacci numbers, <em>see</em> <tt>fibs</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;of integers, <em>see</em> <tt>integers</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3986">of pairs</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;of prime numbers, <em>see</em> <tt>primes</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4126">of random numbers</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3912">representing power series</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4020">to model signals</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3960">to sum a series</a><br>
<a href="book-Z-H-16.html#%_idx_2096">infix notation, prefix notation vs.</a><br>
<a href="book-Z-H-22.html#%_idx_3536"><tt>inform-about-no-value</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3534"><tt>inform-about-value</tt></a><br>
information retrieval, <em>see</em> data base
<br>
<a href="book-Z-H-27.html#%_idx_4702">Ingerman, Peter</a><br>
<a href="book-Z-H-32.html#%_idx_5656"><tt>initialize-stack</tt> operation in register machine</a>, <a href="book-Z-H-32.html#%_idx_5808">[2]</a><br>
<tt>insert!</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3284">in one-dimensional table</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3292">in two-dimensional table</a><br>
<a href="book-Z-H-22.html#%_idx_3238"><tt>insert-queue!</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3256">[2]</a><br>
<a href="book-Z-H-18.html#%_idx_2542"><tt>install-complex-package</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2454"><tt>install-polar-package</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2684"><tt>install-polynomial-package</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2530"><tt>install-rational-package</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2448"><tt>install-rectangular-package</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2520"><tt>install-scheme-number-package</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5304"><tt>instantiate</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5120">instantiate a pattern</a><br>
<a href="book-Z-H-32.html#%_idx_5816">instruction counting</a><br>
<a href="book-Z-H-32.html#%_idx_5666">instruction execution procedure</a><br>
<a href="book-Z-H-35.html#%_idx_6256">instruction sequence</a>, 
<a href="book-Z-H-35.html#%_idx_6378">[2]</a><br>
<a href="book-Z-H-32.html#%_idx_5818">instruction tracing</a><br>
<a href="book-Z-H-32.html#%_idx_5708"><tt>instruction-execution-proc</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5706"><tt>instruction-text</tt></a><br>
<a href="book-Z-H-10.html#%_idx_136">integer(s)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_534">dividing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_530">exact</a><br>
<a href="book-Z-H-18.html#%_idx_2800">integerizing factor</a><br>
<a href="book-Z-H-24.html#%_idx_3836"><tt>integers</tt> (infinite stream)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3866">implicit definition</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4790">lazy-list version</a><br>
<a href="book-Z-H-24.html#%_idx_3834"><tt>integers-starting-from</tt></a><br>
integral, <em>see also</em> definite integral; Monte Carlo integration
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3920">of a power series</a><br>
<a href="book-Z-H-12.html#%_idx_1004"><tt>integral</tt></a>, <a href="book-Z-H-24.html#%_idx_4024">[2]</a>, 
<a href="book-Z-H-24.html#%_idx_4080">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4074">with delayed argument</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1032">with <tt>lambda</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4802">lazy-list version</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4060">need for delayed evaluation</a><br>
<a href="book-Z-H-24.html#%_idx_3924"><tt>integrate-series</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6000">integrated-circuit implementation of Scheme</a>, <a href="book-Z-H-34.html#%_idx_6012">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_4022">integrator, for signals</a><br>
<a href="book-Z-H-24.html#%_idx_4000"><tt>interleave</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5388"><tt>interleave-delayed</tt></a><br>
<a href="book-Z-H-9.html#%_idx_56">Interlisp</a><br>
<a href="book-Z-H-10.html#%_idx_614">internal definition</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3116">in environment model</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_616">free variable in</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1074"><tt>let</tt> vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_5010">in nondeterministic evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_626">position of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4604">restrictions on</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4608">scanning out</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4598">scope of name</a><br>
<a href="book-Z-H-35.html#%_idx_6498">Internet ``Worm''</a><br>
<a href="book-Z-H-33.html#%_idx_5888">interning symbols</a><br>
<a href="book-Z-H-9.html#%_idx_30">interpreter</a>, <em>see also</em> evaluator
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6212">compiler vs.</a>, 
<a href="book-Z-H-35.html#%_idx_6490">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_206">read-eval-print loop</a><br>
<a href="book-Z-H-16.html#%_idx_2110"><tt>intersection-set</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2196">binary-tree representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2130">ordered-list representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2120">unordered-list representation</a><br>
<a href="book-Z-H-14.html#%_idx_1478">interval arithmetic</a><br>
<a href="book-Z-H-11.html#%_idx_816">invariant quantity of an iterative process</a><br>
<a href="book-Z-H-22.html#%_idx_3344">inverter</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3378"><tt>inverter</tt></a><br>
iteration contructs, <em>see</em> looping constructs
<br>
<a href="book-Z-H-12.html#%_idx_1246">iterative improvement</a><br>
<a href="book-Z-H-11.html#%_idx_666">iterative process</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3944">as a stream process</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_818">design of algorithm</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_552">implemented by procedure call</a>, 
<a href="book-Z-H-11.html#%_idx_694">[2]</a>, <a href="book-Z-H-34.html#%_idx_6102">[3]</a>, 
<em>see also</em> tail recursion
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_672">linear</a>, <a href="book-Z-H-11.html#%_idx_772">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_636">recursive process vs.</a>, 
<a href="book-Z-H-21.html#%_idx_3092">[2]</a>, <a href="book-Z-H-31.html#%_idx_5570">[3]</a>, 
<a href="book-Z-H-35.html#%_idx_6408">[4]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5566">register machine for</a><p>

<p><p>

<br>
<a href="book-Z-H-22.html#%_idx_3506">Jayaraman, Sundaresan</a><p>

<p><p>

<br>
<a href="book-Z-H-11.html#%_idx_832">Kaldewaij, Anne</a><br>
<a href="book-Z-H-19.html#%_idx_2822">Karr, Alphonse</a><br>
<a href="book-Z-H-30.html#%_idx_5456">Kepler, Johannes</a><br>
<a href="book-Z-H-16.html#%_idx_2208"><tt>key</tt></a><br>
key of a record
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2206">in a data base</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3270">in a table</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3306">testing equality of</a><br>
<a href="book-Z-H-11.html#%_idx_746">Khayyam, Omar</a><br>
<a href="book-Z-H-11.html#%_idx_744">Knuth, Donald E.</a>, <a href="book-Z-H-11.html#%_idx_814">[2]</a>, 
<a href="book-Z-H-11.html#%_idx_840">[3]</a>, <a href="book-Z-H-15.html#%_idx_1776">[4]</a>, 
<a href="book-Z-H-20.html#%_idx_2924">[5]</a>, <a href="book-Z-H-20.html#%_idx_2944">[6]</a>, 
<a href="#%_idx_6794">[7]</a><br>
<a href="book-Z-H-26.html#%_idx_4376">Kohlbecker, Eugene Edmund, Jr.</a><br>
<a href="book-Z-H-20.html#%_idx_2928">Kolmogorov, A. N.</a><br>
<a href="book-Z-H-22.html#%_idx_3504">Konopasek, Milos</a><br>
<a href="book-Z-H-29.html#%_idx_5058">Kowalski, Robert</a><br>
<a href="book-Z-H-15.html#%_idx_1822">KRC</a>, <a href="book-Z-H-24.html#%_idx_3998">[2]</a><p>

<p><p>

<br>
<a href="book-Z-H-31.html#%_idx_5510"><tt>label</tt> (in register machine)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5770">simulating</a><br>
<a href="book-Z-H-32.html#%_idx_5784"><tt>label-exp</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5786"><tt>label-exp-label</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2662">Lagrange interpolation formula</a><br>
<a href="book-Z-H-12.html#%_idx_1054"><img src="book-Z-G-D-6.gif" border="0">  calculus (lambda calculus)</a><br>
<a href="book-Z-H-12.html#%_idx_1034"><tt>lambda</tt> (special form)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1040"><tt>define</tt> vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1656">with dotted-tail notation</a><br>
<tt>lambda</tt> expression
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1050">as operator of combination</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3076">value of</a><br>
<a href="book-Z-H-26.html#%_idx_4312"><tt>lambda-body</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4310"><tt>lambda-parameters</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4308"><tt>lambda?</tt></a><br>
<a href="book-Z-H-12.html#%_idx_1150">Lambert, J.H.</a><br>
<a href="book-Z-H-11.html#%_idx_850">Lam&eacute;, Gabriel</a><br>
<a href="book-Z-H-11.html#%_idx_848">Lam&eacute;'s Theorem</a><br>
<a href="book-Z-H-23.html#%_idx_3722">Lamport, Leslie</a><br>
<a href="book-Z-H-20.html#%_idx_3006">Lampson, Butler</a><br>
<a href="book-Z-H-10.html#%_idx_280">Landin, Peter</a>, <a href="book-Z-H-24.html#%_idx_3810">[2]</a><br>
language, <em>see</em> natural language; programming language
<br>
<a href="book-Z-H-26.html#%_idx_4650">Lapalme, Guy</a><br>
<a href="book-Z-H-26.html#%_idx_4330"><tt>last-exp?</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6064"><tt>last-operand?</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1638"><tt>last-pair</tt></a>, <a href="book-Z-H-22.html#%_idx_3168">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5166">rules</a><br>
<a href="book-Z-H-27.html#%_idx_4684">lazy evaluation</a><br>
<a href="book-Z-H-27.html#%_idx_4666">lazy evaluator</a><br>
<a href="book-Z-H-27.html#%_idx_4756">lazy list</a><br>
<a href="book-Z-H-27.html#%_idx_4760">lazy pair</a><br>
<a href="book-Z-H-27.html#%_idx_4794">lazy tree</a><br>
<a href="book-Z-H-16.html#%_idx_2252"><tt>leaf?</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2364">least commitment, principle of</a><br>
<a href="book-Z-H-12.html#%_idx_1110">lecture, something to do during</a><br>
<a href="book-Z-H-16.html#%_idx_2154"><tt>left-branch</tt></a>, 
<a href="book-Z-H-16.html#%_idx_2260">[2]</a><br>
Leibniz, Baron Gottfried Wilhelm von
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_880">proof of Fermat's Little Theorem</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_976">series for <img src="book-Z-G-D-9.gif" border="0"> </a>, 
<a href="book-Z-H-24.html#%_idx_3952">[2]</a><br>
<a href="book-Z-H-16.html#%_idx_2178">Leiserson, Charles E.</a>, 
<a href="book-Z-H-24.html#%_idx_4016">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1620"><tt>length</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1770">as accumulation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1626">iterative version</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1624">recursive version</a><br>
<a href="book-Z-H-12.html#%_idx_1062"><tt>let</tt> (special form)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3110">evaluation model</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1076">internal definition vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4414">named</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1070">scope of variables</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1068">as syntactic sugar</a>, 
<a href="book-Z-H-21.html#%_idx_3108">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4408"><tt>let*</tt> (special form)</a><br>
<a href="book-Z-H-26.html#%_idx_4618"><tt>letrec</tt> (special form)</a><br>
<a href="book-Z-H-35.html#%_idx_6430">lexical addressing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6434">lexical address</a><br>
<a href="book-Z-H-10.html#%_idx_620">lexical scoping</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6432">environment structure and</a><br>
<a href="book-Z-H-35.html#%_idx_6436"><tt>lexical-address-lookup</tt></a>, 
<a href="book-Z-H-35.html#%_idx_6442">[2]</a><br>
<a href="book-Z-H-35.html#%_idx_6438"><tt>lexical-address-set!</tt></a>, 
<a href="book-Z-H-35.html#%_idx_6444">[2]</a><br>
<a href="book-Z-H-33.html#%_idx_5952">Lieberman, Henry</a><br>
LIFO buffer, <em>see</em> stack
<br>
line segment
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1396">represented as pair of points</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1952">represented as pair of vectors</a><br>
<a href="book-Z-H-11.html#%_idx_658">linear growth</a>, <a href="book-Z-H-11.html#%_idx_780">[2]</a><br>
<a href="book-Z-H-11.html#%_idx_674">linear iterative process</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_770">order of growth</a><br>
<a href="book-Z-H-11.html#%_idx_662">linear recursive process</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_764">order of growth</a><br>
<a href="book-Z-H-35.html#%_idx_6250">linkage descriptor</a><br>
<a href="book-Z-H-14.html#%_idx_1444">Liskov, Barbara Huberman</a><br>
Lisp
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_38">acronym for LISt Processing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_346">applicative-order evaluation in</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5938">on DEC PDP-1</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_98">efficiency of</a>, <a href="book-Z-H-10.html#%_idx_214">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1222">first-class procedures in</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_96">Fortran vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_24">history of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2550">internal type system</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1340">original implementation on IBM&nbsp;704</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_290">Pascal vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-25.html#%_idx_4202">suitability for writing evaluators</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_112">unique features of</a><br>
Lisp dialects
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_94">Common Lisp</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_76">Franz Lisp</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_58">Interlisp</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_48">MacLisp</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5986">MDL</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_68">Portable Standard Lisp</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_44">Scheme</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_82">Zetalisp</a><br>
<a href="book-Z-H-29.html#%_idx_5332"><tt>lisp-value</tt> (query interpreter)</a><br>
<a href="book-Z-H-29.html#%_idx_5132"><tt>lisp-value</tt> (query language)</a>, 
<a href="book-Z-H-29.html#%_idx_5270">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5206">evaluation of</a>, 
<a href="book-Z-H-29.html#%_idx_5330">[2]</a>, <a href="book-Z-H-29.html#%_idx_5440">[3]</a><br>
<a href="book-Z-H-15.html#%_idx_1568"><tt>list</tt> (primitive procedure)</a><br>
<a href="book-Z-H-14.html#%_idx_1342">list structure</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1572">list vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3134">mutable</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5854">represented using vectors</a><br>
<a href="book-Z-H-15.html#%_idx_1566">list(s)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6280">backquote with</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1608"><tt>cdr</tt>ing down</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1634">combining with <tt>append</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1630"><tt>cons</tt>ing up</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2184">converting a binary tree to a</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2190">converting to a binary tree</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;empty, <em>see</em> empty list
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2036">equality of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3278">headed</a>, <a href="book-Z-H-22.html#%_idx_3454">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1640">last pair of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4758">lazy</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1622">length of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1574">list structure vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1578">manipulation with <tt>car</tt>, <tt>cdr</tt>, and <tt>cons</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1658">mapping over</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1610"><em>n</em>th element of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1602">operations on</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1576">printed representation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2012">quotation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1644">reversing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1604">techniques for manipulating</a><br>
<a href="book-Z-H-16.html#%_idx_2192"><tt>list-&gt;tree</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6394"><tt>list-difference</tt></a><br>
<a href="book-Z-H-27.html#%_idx_4726"><tt>list-of-arg-values</tt></a><br>
<a href="book-Z-H-27.html#%_idx_4728"><tt>list-of-delayed-args</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4256"><tt>list-of-values</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1612"><tt>list-ref</tt></a>, <a href="book-Z-H-27.html#%_idx_4780">[2]</a><br>
<a href="book-Z-H-33.html#%_idx_5828">list-structured memory</a><br>
<a href="book-Z-H-35.html#%_idx_6392"><tt>list-union</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5140"><tt>lives-near</tt> (rule)</a>, 
<a href="book-Z-H-29.html#%_idx_5154">[2]</a><br>
<a href="book-Z-H-11.html#%_idx_632">local evolution of a process</a><br>
<a href="book-Z-H-10.html#%_idx_578">local name</a>, <a href="book-Z-H-12.html#%_idx_1060">[2]</a><br>
<a href="book-Z-H-20.html#%_idx_2838">local state</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3100">maintained in frames</a><br>
<a href="book-Z-H-20.html#%_idx_2844">local state variable</a><br>
<a href="book-Z-H-12.html#%_idx_1058">local variable</a><br>
<a href="book-Z-H-33.html#%_idx_5836">location</a><br>
<a href="book-Z-H-9.html#%_idx_6">Locke, John</a><br>
<a href="book-Z-H-12.html#%_idx_1134"><tt>log</tt> (primitive procedure)</a><br>
<a href="book-Z-H-24.html#%_idx_3982">logarithm, approximating <tt>ln</tt> 2</a><br>
<a href="book-Z-H-11.html#%_idx_784">logarithmic growth</a>, 
<a href="book-Z-H-11.html#%_idx_808">[2]</a>, <a href="book-Z-H-16.html#%_idx_2148">[3]</a><br>
<a href="book-Z-H-29.html#%_idx_5028">logic programming</a>, 
<em>see also</em> query language; query interpreter
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5084">computers for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5040">history of</a>, <a href="book-Z-H-29.html#%_idx_5080">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5082">in Japan</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5076">logic programming languages</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5246">mathematical logic vs.</a><br>
<a href="book-Z-H-28.html#%_idx_4928">logic puzzles</a><br>
<a href="book-Z-H-22.html#%_idx_3348">logical and</a><br>
<a href="book-Z-H-22.html#%_idx_3352">logical or</a><br>
<a href="book-Z-H-22.html#%_idx_3380"><tt>logical-not</tt></a><br>
<tt>lookup</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3280">in one-dimensional table</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2210">in set of records</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3290">in two-dimensional table</a><br>
<a href="book-Z-H-32.html#%_idx_5714"><tt>lookup-label</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5798"><tt>lookup-prim</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4456"><tt>lookup-variable-value</tt></a>, 
<a href="book-Z-H-26.html#%_idx_4480">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4612">for scanned-out definitions</a><br>
<a href="book-Z-H-10.html#%_idx_554">looping constructs</a>, 
<a href="book-Z-H-11.html#%_idx_690">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4426">implementing in metacircular evaluator</a><br>
<a href="book-Z-H-14.html#%_idx_1506"><tt>lower-bound</tt></a><p>

<p><p>

<br>
<a href="book-Z-H-35.html#%_idx_6206">machine language</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-25.html#%_idx_4192">high-level language vs.</a><br>
<a href="book-Z-H-34.html#%_idx_6192">Macintosh</a><br>
<a href="book-Z-H-9.html#%_idx_46">MacLisp</a><br>
<a href="book-Z-H-26.html#%_idx_4374">macro</a>, 
<em>see also</em> reader macro character
<br>
magician, <em>see</em> numerical analyst
<br>
<tt>magnitude</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2468">data-directed</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2348">polar representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2332">rectangular representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2410">with tagged data</a><br>
<a href="book-Z-H-17.html#%_idx_2394"><tt>magnitude-polar</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2382"><tt>magnitude-rectangular</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2896"><tt>make-account</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3126">in environment model</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3616">with serialization</a>, 
<a href="book-Z-H-23.html#%_idx_3618">[2]</a>, <a href="book-Z-H-23.html#%_idx_3620">[3]</a><br>
<a href="book-Z-H-23.html#%_idx_3630"><tt>make-account-and-serializer</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2904"><tt>make-accumulator</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3412"><tt>make-agenda</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3456">[2]</a><br>
<a href="book-Z-H-32.html#%_idx_5722"><tt>make-assign</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4338"><tt>make-begin</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5742"><tt>make-branch</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1522"><tt>make-center-percent</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1516"><tt>make-center-width</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2258"><tt>make-code-tree</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6332"><tt>make-compiled-procedure</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2546"><tt>make-complex-from-mag-ang</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2544"><tt>make-complex-from-real-imag</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3546"><tt>make-connector</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3172"><tt>make-cycle</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2984"><tt>make-decrementer</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5718"><tt>make-execution-procedure</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1914"><tt>make-frame</tt></a>, 
<a href="book-Z-H-15.html#%_idx_1944">[2]</a>, <a href="book-Z-H-26.html#%_idx_4470">[3]</a><br>
<a href="book-Z-H-17.html#%_idx_2416"><tt>make-from-mag-ang</tt></a>, 
<a href="book-Z-H-17.html#%_idx_2474">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2492">message-passing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2354">polar representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2338">rectangular representation</a><br>
<a href="book-Z-H-17.html#%_idx_2400"><tt>make-from-mag-ang-polar</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2388"><tt>make-from-mag-ang-rectangular</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2414"><tt>make-from-real-imag</tt></a>, 
<a href="book-Z-H-17.html#%_idx_2472">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2488">message-passing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2352">polar representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2336">rectangular representation</a><br>
<a href="book-Z-H-17.html#%_idx_2398"><tt>make-from-real-imag-polar</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2386"><tt>make-from-real-imag-rectangular</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5748"><tt>make-goto</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4324"><tt>make-if</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5704"><tt>make-instruction</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6266"><tt>make-instruction-sequence</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1486"><tt>make-interval</tt></a>, 
<a href="book-Z-H-14.html#%_idx_1502">[2]</a><br>
<a href="book-Z-H-20.html#%_idx_3028"><tt>make-joint</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6322"><tt>make-label</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5712"><tt>make-label-entry</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4314"><tt>make-lambda</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2250"><tt>make-leaf</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2276"><tt>make-leaf-set</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5626"><tt>make-machine</tt></a>, 
<a href="book-Z-H-32.html#%_idx_5638">[2]</a><br>
<a href="book-Z-H-20.html#%_idx_2906"><tt>make-monitored</tt></a><br>
<a href="book-Z-H-23.html#%_idx_3668"><tt>make-mutex</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5672"><tt>make-new-machine</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5790"><tt>make-operation-exp</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5764"><tt>make-perform</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1406"><tt>make-point</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2686"><tt>make-poly</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2750"><tt>make-polynomial</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5774"><tt>make-primitive-exp</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4444"><tt>make-procedure</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2070"><tt>make-product</tt></a>, 
<a href="book-Z-H-16.html#%_idx_2092">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3232"><tt>make-queue</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3252">[2]</a><br>
<a href="book-Z-H-14.html#%_idx_1300"><tt>make-rat</tt></a>, <a href="book-Z-H-14.html#%_idx_1348">[2]</a>, 
<a href="book-Z-H-14.html#%_idx_1390">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1416">axiom for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1378">reducing to lowest terms</a><br>
<a href="book-Z-H-18.html#%_idx_2532"><tt>make-rational</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5642"><tt>make-register</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5756"><tt>make-restore</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5754"><tt>make-save</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2522"><tt>make-scheme-number</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1398"><tt>make-segment</tt></a>, 
<a href="book-Z-H-15.html#%_idx_1954">[2]</a><br>
<a href="book-Z-H-23.html#%_idx_3660"><tt>make-serializer</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2982"><tt>make-simplified-withdraw</tt></a>, 
<a href="book-Z-H-24.html#%_idx_4150">[2]</a><br>
<a href="book-Z-H-32.html#%_idx_5650"><tt>make-stack</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5812">with monitored stack</a><br>
<a href="book-Z-H-16.html#%_idx_2068"><tt>make-sum</tt></a>, <a href="book-Z-H-16.html#%_idx_2088">[2]</a><br>
<tt>make-table</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3296">message-passing implementation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3286">one-dimensional table</a><br>
<a href="book-Z-H-24.html#%_idx_3974"><tt>make-tableau</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2702"><tt>make-term</tt></a>, <a href="book-Z-H-18.html#%_idx_2744">[2]</a><br>
<a href="book-Z-H-32.html#%_idx_5736"><tt>make-test</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3442"><tt>make-time-segment</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2158"><tt>make-tree</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1932"><tt>make-vect</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3358"><tt>make-wire</tt></a>, <a href="book-Z-H-22.html#%_idx_3396">[2]</a>, 
<a href="book-Z-H-22.html#%_idx_3434">[3]</a><br>
<a href="book-Z-H-20.html#%_idx_2894"><tt>make-withdraw</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3104">in environment model</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3106">using <tt>let</tt></a><br>
making change, <em>see</em> counting change
<br>
<a href="book-Z-H-15.html#%_idx_1666"><tt>map</tt></a>, <a href="book-Z-H-27.html#%_idx_4782">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1766">as accumulation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1664">with multiple arguments</a><br>
<a href="book-Z-H-29.html#%_idx_5412"><tt>map-over-symbols</tt></a><br>
<a href="book-Z-H-24.html#%_idx_4130"><tt>map-successive-pairs</tt></a><br>
mapping
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1660">over lists</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1818">nested</a>, <a href="book-Z-H-24.html#%_idx_3988">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1734">as a transducer</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1706">over trees</a><br>
<a href="book-Z-H-33.html#%_idx_5956">mark-sweep garbage collector</a><br>
mathematical function, <em>see</em> function (mathematical)
<br>
mathematics
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_496">computer science vs.</a>, 
<a href="book-Z-H-29.html#%_idx_5034">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_918">engineering vs.</a><br>
<a href="book-Z-H-15.html#%_idx_1796">matrix, represented as sequence</a><br>
<a href="book-Z-H-15.html#%_idx_1808"><tt>matrix-*-matrix</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1804"><tt>matrix-*-vector</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1494"><tt>max</tt> (primitive procedure)</a><br>
<a href="book-Z-H-28.html#%_idx_4892">McAllester, David Allen</a>, 
<a href="book-Z-H-28.html#%_idx_4902">[2]</a><br>
<a href="book-Z-H-9.html#%_idx_28">McCarthy, John</a>, <a href="book-Z-H-9.html#%_idx_32">[2]</a>, 
<a href="book-Z-H-9.html#%_idx_36">[3]</a>, <a href="book-Z-H-28.html#%_idx_4824">[4]</a><br>
<a href="book-Z-H-28.html#%_idx_4878">McDermott, Drew</a><br>
<a href="book-Z-H-33.html#%_idx_5984">MDL</a><br>
<a href="book-Z-H-10.html#%_idx_126">means of abstraction</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_232"><tt>define</tt></a><br>
<a href="book-Z-H-10.html#%_idx_122">means of combination</a>, 
<em>see also</em> closure
<br>
<a href="book-Z-H-18.html#%_idx_2792">measure in a Euclidean ring</a><br>
<a href="book-Z-H-28.html#%_idx_4936"><tt>member</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3324"><tt>memo-fib</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3804"><tt>memo-proc</tt></a><br>
<a href="book-Z-H-11.html#%_idx_736">memoization</a>, <a href="book-Z-H-22.html#%_idx_3314">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3904">call-by-need and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3802">by <tt>delay</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4746">garbage collection and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4710">of thunks</a><br>
<a href="book-Z-H-22.html#%_idx_3326"><tt>memoize</tt></a><br>
memory
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4838">in 1964</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5830">list-structured</a><br>
<a href="book-Z-H-16.html#%_idx_2030"><tt>memq</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3898"><tt>merge</tt></a><br>
<a href="book-Z-H-24.html#%_idx_4008"><tt>merge-weighted</tt></a><br>
merging infinite streams, <em>see</em> infinite stream(s)
<br>
<a href="book-Z-H-14.html#%_idx_1466">message passing</a>, <a href="book-Z-H-17.html#%_idx_2486">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3122">environment model and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2900">in bank account</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3394">in digital-circuit simulation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_704">tail recursion and</a><br>
<a href="book-Z-H-26.html#%_idx_4212">metacircular evaluator</a><br>
<a href="book-Z-H-26.html#%_idx_4210">metacircular evaluator for Scheme</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4638">analyzing version</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4384">combinations (procedure applications)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6516">compilation of</a>, 
<a href="book-Z-H-35.html#%_idx_6524">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4224">data abstraction in</a>, 
<a href="book-Z-H-26.html#%_idx_4234">[2]</a>, <a href="book-Z-H-26.html#%_idx_4430">[3]</a>, 
<a href="book-Z-H-26.html#%_idx_4486">[4]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4390">data-directed <tt>eval</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4352">derived expressions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4516">driver loop</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4640">efficiency of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4218">environment model of evaluation in</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4454">environment operations</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4226"><tt>eval</tt> and <tt>apply</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4220"><tt>eval</tt>-<tt>apply</tt> cycle</a>, 
<a href="book-Z-H-26.html#%_idx_4228">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4232">expression representation</a>, 
<a href="book-Z-H-26.html#%_idx_4274">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4496">global environment</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4252">higher-order procedures in</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4260">implemented language vs. implementation language</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4222">job of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4272">order of operand evaluation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4494">primitive procedures</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4464">representation of environments</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4438">representation of procedures</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4432">representation of true and false</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4492">running</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4394">special forms (additional)</a>, 
<a href="book-Z-H-26.html#%_idx_4404">[2]</a>, <a href="book-Z-H-26.html#%_idx_4406">[3]</a>, 
<a href="book-Z-H-26.html#%_idx_4412">[4]</a>, <a href="book-Z-H-26.html#%_idx_4420">[5]</a>, 
<a href="book-Z-H-26.html#%_idx_4424">[6]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4354">special forms as derived expressions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4278">symbolic differentiation and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4276">syntax of evaluated language</a>, 
<a href="book-Z-H-26.html#%_idx_4386">[2]</a>, <a href="book-Z-H-26.html#%_idx_4428">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6094">tail recursiveness unspecified in</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4500"><tt>true</tt> and <tt>false</tt></a><br>
<a href="book-Z-H-25.html#%_idx_4194">metalinguistic abstraction</a><br>
<a href="book-Z-H-28.html#%_idx_4874">MicroPlanner</a><br>
<a href="book-Z-H-29.html#%_idx_5100">Microshaft</a><br>
<a href="book-Z-H-14.html#%_idx_1408"><tt>midpoint-segment</tt></a><br>
<a href="book-Z-H-11.html#%_idx_956">Miller, Gary L.</a><br>
<a href="book-Z-H-35.html#%_idx_6368">Miller, James S.</a><br>
<a href="book-Z-H-11.html#%_idx_954">Miller-Rabin test for primality</a><br>
<a href="book-Z-H-24.html#%_idx_4110">Milner, Robin</a><br>
<a href="book-Z-H-14.html#%_idx_1490"><tt>min</tt> (primitive procedure)</a><br>
<a href="book-Z-H-7.html#%_idx_4">Minsky, Marvin Lee</a>, <a href="book-Z-H-33.html#%_idx_5936">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1824">Miranda</a><br>
<a href="book-Z-H-29.html#%_idx_5066">MIT</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_84">Artificial Intelligence Laboratory</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1866">early history of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_54">Project MAC</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_34">Research Laboratory of Electronics</a>, 
<a href="book-Z-H-33.html#%_idx_5940">[2]</a><br>
MIT Scheme
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3756">the empty stream</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4580"><tt>eval</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4610">internal definitions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_544">numbers</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2964"><tt>random</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4582"><tt>user-initial-environment</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3678"><tt>without-interrupts</tt></a><br>
<a href="book-Z-H-24.html#%_idx_4106">ML</a><br>
<a href="book-Z-H-15.html#%_idx_1700">mobile</a><br>
modeling
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-19.html#%_idx_2826">as a design strategy</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_336">in science and engineering</a><br>
<a href="book-Z-H-34.html#%_idx_6130">models of evaluation</a><br>
modified registers, <em>see</em> instruction sequence
<br>
<a href="book-Z-H-35.html#%_idx_6388"><tt>modifies-register?</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1756">modularity</a>, <a href="book-Z-H-19.html#%_idx_2824">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4184">along object boundaries</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4116">functional programs vs. objects</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2892">hiding principle</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3942">streams and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2428">through dispatching on type</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4134">through infinite streams</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2920">through modeling with objects</a><br>
<a href="book-Z-H-11.html#%_idx_892">modulo <em>n</em></a><br>
<a href="book-Z-H-29.html#%_idx_5250"><em>modus ponens</em></a><br>
money, changing, <em>see</em> counting change
<br>
<a href="book-Z-H-20.html#%_idx_2908">monitored procedure</a><br>
<a href="book-Z-H-20.html#%_idx_2956">Monte Carlo integration</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4138">stream formulation</a><br>
<a href="book-Z-H-20.html#%_idx_2936">Monte Carlo simulation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4122">stream formulation</a><br>
<a href="book-Z-H-20.html#%_idx_2952"><tt>monte-carlo</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4132">infinite stream</a><br>
<a href="book-Z-H-9.html#%_idx_50">Moon, David A.</a>, <a href="book-Z-H-33.html#%_idx_5954">[2]</a><br>
morning star, <em>see</em> evening star
<br>
<a href="book-Z-H-20.html#%_idx_3008">Morris, J. H.</a><br>
<a href="book-Z-H-16.html#%_idx_2228">Morse code</a><br>
<a href="book-Z-H-29.html#%_idx_5262">Mouse, Minnie and Mickey</a><br>
<a href="book-Z-H-18.html#%_idx_2508"><tt>mul</tt> (generic)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2716">used for polynomial coefficients</a><br>
<a href="book-Z-H-17.html#%_idx_2316"><tt>mul-complex</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1498"><tt>mul-interval</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1514">more efficient version</a><br>
<a href="book-Z-H-18.html#%_idx_2676"><tt>mul-poly</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1312"><tt>mul-rat</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3932"><tt>mul-series</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3886"><tt>mul-streams</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2712"><tt>mul-terms</tt></a><br>
<a href="book-Z-H-33.html#%_idx_5946">Multics time-sharing system</a><br>
<a href="book-Z-H-28.html#%_idx_4938"><tt>multiple-dwelling</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2082"><tt>multiplicand</tt></a><br>
<a href="book-Z-H-11.html#%_idx_822">multiplication by Russian peasant method</a><br>
<tt>multiplier</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3538">primitive constraint</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2080">selector</a><br>
<a href="book-Z-H-15.html#%_idx_1790">Munro, Ian</a><br>
<a href="book-Z-H-22.html#%_idx_3128">mutable data objects</a>, 
<em>see also</em> queue; table
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3198">implemented with assignment</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3132">list structure</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3136">pairs</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3196">procedural representation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3190">shared data</a><br>
<a href="book-Z-H-22.html#%_idx_3130">mutator</a><br>
<a href="book-Z-H-23.html#%_idx_3640">mutex</a><br>
<a href="book-Z-H-23.html#%_idx_3646">mutual exclusion</a><br>
<a href="book-Z-H-22.html#%_idx_3174"><tt>mystery</tt></a><p>

<p><p>

<br>
name, <em>see also</em> local name; variable; local variable
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2888">encapsulated</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_582">of a formal parameter</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_310">of a procedure</a><br>
<a href="book-Z-H-26.html#%_idx_4416">named <tt>let</tt> (special form)</a><br>
naming
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_216">of computational objects</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_300">of procedures</a><br>
naming conventions
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2868"><tt>!</tt> for assignment and mutation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_520"><tt>?</tt> for predicates</a><br>
<a href="book-Z-H-35.html#%_idx_6204">native language of machine</a><br>
natural language
<br>
&nbsp;&nbsp;&nbsp;&nbsp;parsing, <em>see</em> parsing natural language
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_1994">quotation in</a><br>
needed registers, <em>see</em> instruction sequence
<br>
<a href="book-Z-H-35.html#%_idx_6386"><tt>needs-register?</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5328"><tt>negate</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1584">nested applications of <tt>car</tt> and <tt>cdr</tt></a><br>
<a href="book-Z-H-10.html#%_idx_196">nested combinations</a><br>
nested definitions, <em>see</em> internal definition
<br>
nested mappings, <em>see</em> mapping
<br>
<a href="book-Z-H-33.html#%_idx_5992"><tt>new</tt> register</a><br>
<a href="book-Z-H-33.html#%_idx_5972"><tt>new-cars</tt> register</a><br>
<a href="book-Z-H-33.html#%_idx_5974"><tt>new-cdrs</tt> register</a><br>
<a href="book-Z-H-20.html#%_idx_2884"><tt>new-withdraw</tt></a><br>
<a href="book-Z-H-11.html#%_idx_938"><tt>newline</tt> (primitive procedure)</a>, 
<a href="book-Z-H-14.html#%_idx_1362">[2]</a><br>
Newton's method
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_562">for cube roots</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1178">for differentiable functions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1182">half-interval method vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_510">for square roots</a>, 
<a href="book-Z-H-12.html#%_idx_1200">[2]</a>, <a href="book-Z-H-12.html#%_idx_1212">[3]</a><br>
<a href="book-Z-H-12.html#%_idx_1196"><tt>newton-transform</tt></a><br>
<a href="book-Z-H-12.html#%_idx_1198"><tt>newtons-method</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6252"><tt>next</tt> (linkage descriptor)</a><br>
<a href="book-Z-H-29.html#%_idx_5164"><tt>next-to</tt> (rules)</a><br>
<tt>nil</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2020">dispensing with</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1596">as empty list</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1562">as end-of-list marker</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1598">as ordinary variable in Scheme</a><br>
<a href="book-Z-H-34.html#%_idx_6098"><tt>no-more-exps?</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4346"><tt>no-operands?</tt></a><br>
<a href="book-Z-H-10.html#%_idx_256">node of a tree</a><br>
<a href="book-Z-H-26.html#%_idx_4594">non-computable</a><br>
<a href="book-Z-H-27.html#%_idx_4686">non-strict</a><br>
<a href="book-Z-H-23.html#%_idx_3604">nondeterminism, in behavior of concurrent programs</a>, <a href="book-Z-H-24.html#%_idx_4180">[2]</a><br>
<a href="book-Z-H-28.html#%_idx_4836">nondeterministic choice point</a><br>
<a href="book-Z-H-28.html#%_idx_4806">nondeterministic computing</a><br>
<a href="book-Z-H-28.html#%_idx_4978">nondeterministic evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4970">order of operand evaluation</a><br>
<a href="book-Z-H-28.html#%_idx_4810">nondeterministic programming vs. Scheme programming</a>, <a href="book-Z-H-28.html#%_idx_4940">[2]</a>, 
<a href="book-Z-H-28.html#%_idx_4950">[3]</a>, <a href="book-Z-H-29.html#%_idx_5442">[4]</a><br>
nondeterministic programs
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4930">logic puzzles</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4812">pairs with prime sums</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4954">parsing natural language</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4914">Pythagorean triples</a>, 
<a href="book-Z-H-28.html#%_idx_4918">[2]</a>, <a href="book-Z-H-28.html#%_idx_4922">[3]</a><br>
<a href="book-Z-H-10.html#%_idx_340">normal-order evaluation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_480">applicative order vs.</a>, 
<a href="book-Z-H-11.html#%_idx_852">[2]</a>, <a href="book-Z-H-27.html#%_idx_4680">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4092">delayed evaluation and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6126">in explicit-control evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_484">of <tt>if</tt></a><br>
normal-order evaluator, <em>see</em> lazy evaluator
<br>
<a href="book-Z-H-10.html#%_idx_462"><tt>not</tt> (primitive procedure)</a><br>
<a href="book-Z-H-29.html#%_idx_5130"><tt>not</tt> (query language)</a>, 
<a href="book-Z-H-29.html#%_idx_5268">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5204">evaluation of</a>, 
<a href="book-Z-H-29.html#%_idx_5326">[2]</a>, <a href="book-Z-H-29.html#%_idx_5438">[3]</a><br>
notation in this book
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_314">italic symbols in expression syntax</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_152">slanted characters for interpreter response</a><br>
<a href="book-Z-H-28.html#%_idx_4956"><tt>nouns</tt></a><br>
<a href="book-Z-H-12.html#%_idx_1242"><em>n</em>th root, as fixed point</a><br>
<a href="book-Z-H-15.html#%_idx_1614"><tt>null?</tt> (primitive procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5912">implemented with typed pointers</a><br>
<a href="book-Z-H-11.html#%_idx_874">number theory</a><br>
number(s)
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_404">comparison of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_540">decimal point in</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_406">equality of</a>, <a href="book-Z-H-16.html#%_idx_2038">[2]</a>, 
<a href="book-Z-H-33.html#%_idx_5878">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2512">in generic arithmetic system</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_548">implementation dependencies</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_140">integer vs. real number</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_538">integer, exact</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_148">in Lisp</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_536">rational number</a><br>
<a href="book-Z-H-16.html#%_idx_2052"><tt>number?</tt> (primitive procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2554">data types and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5916">implemented with typed pointers</a><br>
<a href="book-Z-H-14.html#%_idx_1302"><tt>numer</tt></a>, <a href="book-Z-H-14.html#%_idx_1350">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1418">axiom for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1392">reducing to lowest terms</a><br>
<a href="book-Z-H-10.html#%_idx_142">numerical analysis</a><br>
<a href="book-Z-H-12.html#%_idx_1086">numerical analyst</a><br>
<a href="book-Z-H-10.html#%_idx_132">numerical data</a><p>

<p><p>

<br>
<a href="book-Z-H-33.html#%_idx_5886">obarray</a><br>
<a href="book-Z-H-35.html#%_idx_6218">object program</a><br>
<a href="book-Z-H-19.html#%_idx_2828">object(s)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2918">benefits of modeling with</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2850">with time-varying state</a><br>
<a href="book-Z-H-18.html#%_idx_2622">object-oriented programming languages</a><br>
<a href="book-Z-H-33.html#%_idx_5990"><tt>old</tt> register</a><br>
<a href="book-Z-H-33.html#%_idx_5994"><tt>oldcr</tt> register</a><br>
<a href="book-Z-H-24.html#%_idx_3862"><tt>ones</tt> (infinite stream)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4788">lazy-list version</a><br>
<a href="book-Z-H-31.html#%_idx_5522"><tt>op</tt> (in register machine)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5788">simulating</a><br>
<a href="book-Z-H-35.html#%_idx_6424">open coding of primitives</a>, 
<a href="book-Z-H-35.html#%_idx_6460">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4344"><tt>operands</tt></a><br>
<a href="book-Z-H-10.html#%_idx_184">operands of a combination</a><br>
operation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2572">cross-type</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-13.html#%_idx_1276">generic</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5472">in register machine</a><br>
<a href="book-Z-H-17.html#%_idx_2436">operation-and-type table</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2856">assignment needed for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3298">implementing</a><br>
<a href="book-Z-H-32.html#%_idx_5792"><tt>operation-exp</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5794"><tt>operation-exp-op</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5796"><tt>operation-exp-operands</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4342"><tt>operator</tt></a><br>
<a href="book-Z-H-10.html#%_idx_182">operator of a combination</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1166">combination as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_478">compound expression as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1052"><tt>lambda</tt> expression as</a><br>
optimality
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1782">of Horner's rule</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2244">of Huffman code</a><br>
<a href="book-Z-H-29.html#%_idx_5128"><tt>or</tt> (query language)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5200">evaluation of</a>, 
<a href="book-Z-H-29.html#%_idx_5322">[2]</a><br>
<a href="book-Z-H-10.html#%_idx_454"><tt>or</tt> (special form)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_458">evaluation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_468">why a special form</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4398">with no subexpressions</a><br>
<a href="book-Z-H-22.html#%_idx_3350">or-gate</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3384"><tt>or-gate</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3386">[2]</a><br>
<a href="book-Z-H-18.html#%_idx_2704"><tt>order</tt></a>, <a href="book-Z-H-18.html#%_idx_2746">[2]</a><br>
<a href="book-Z-H-11.html#%_idx_760">order notation</a><br>
order of evaluation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_3032">assignment and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3066">implementation-dependent</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6414">in compiler</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6070">in explicit-control evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4270">in metacircular evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_3030">in Scheme</a><br>
order of events
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3794">decoupling apparent from actual</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3590">indeterminacy in concurrent systems</a><br>
<a href="book-Z-H-11.html#%_idx_752">order of growth</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_768">linear iterative process</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_762">linear recursive process</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_806">logarithmic</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_774">tree-recursive process</a><br>
order of subexpression evaluation, <em>see</em> order of evaluation
<br>
<a href="book-Z-H-16.html#%_idx_2126">ordered-list representation of sets</a><br>
<a href="book-Z-H-18.html#%_idx_2514">ordinary numbers (in generic arithmetic system)</a><br>
<a href="book-Z-H-15.html#%_idx_1916"><tt>origin-frame</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1784">Ostrowski, A. M.</a><br>
<a href="book-Z-H-29.html#%_idx_5152"><tt>outranked-by</tt> (rule)</a>, 
<a href="book-Z-H-29.html#%_idx_5276">[2]</a><p>

<p><p>

<br>
<a href="book-Z-H-23.html#%_idx_3654">P operation on semaphore</a><br>
<a href="book-Z-H-17.html#%_idx_2442">package</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2536">complex-number</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2450">polar representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2678">polynomial</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2524">rational-number</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2444">rectangular representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2516">Scheme-number</a><br>
<a href="book-Z-H-15.html#%_idx_1862">painter(s)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1898">higher-order operations</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1876">operations</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1946">represented as procedures</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1960">transforming and combining</a><br>
<a href="book-Z-H-14.html#%_idx_1318">pair(s)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1458">axiomatic definition of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1526">box-and-pointer notation for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3984">infinite stream of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4762">lazy</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3138">mutable</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1450">procedural representation of</a>, 
<a href="book-Z-H-22.html#%_idx_3200">[2]</a>, <a href="book-Z-H-27.html#%_idx_4772">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5852">represented using vectors</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1558">used to represent sequence</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1678">used to represent tree</a><br>
<a href="book-Z-H-15.html#%_idx_1686"><tt>pair?</tt> (primitive procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5910">implemented with typed pointers</a><br>
<a href="book-Z-H-24.html#%_idx_4002"><tt>pairs</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1786">Pan, V. Y.</a><br>
<a href="book-Z-H-23.html#%_idx_3612"><tt>parallel-execute</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6402"><tt>parallel-instruction-sequences</tt></a><br>
parallelism, <em>see</em> concurrency
<br>
parameter, <em>see</em> formal parameters
<br>
parameter passing, <em>see</em> call-by-name argument passing; call-by-need argument passing
<br>
parentheses
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_178">delimiting combination</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_360">delimiting <tt>cond</tt> clauses</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_328">in procedure definition</a><br>
<a href="book-Z-H-28.html#%_idx_4966"><tt>parse</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4964"><tt>parse-...</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4952">parsing natural language</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4972">real language understanding vs. toy parser</a><br>
<a href="book-Z-H-24.html#%_idx_3892"><tt>partial-sums</tt></a><br>
<a href="book-Z-H-10.html#%_idx_288">Pascal</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4100">lack of higher-order procedures</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_686">recursive procedures</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1548">restrictions on compound data</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3572">weakness in handling compound objects</a><br>
<a href="book-Z-H-11.html#%_idx_742">Pascal, Blaise</a><br>
<a href="book-Z-H-11.html#%_idx_738">Pascal's triangle</a><br>
<a href="book-Z-H-20.html#%_idx_2914">password-protected bank account</a><br>
<a href="book-Z-H-29.html#%_idx_5112">pattern</a><br>
<a href="book-Z-H-29.html#%_idx_5176">pattern matching</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5342">implementation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5212">unification vs.</a>, 
<a href="book-Z-H-29.html#%_idx_5222">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5114">pattern variable</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5298">representation of</a>, 
<a href="book-Z-H-29.html#%_idx_5400">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5346"><tt>pattern-match</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5662"><tt>pc</tt> register</a><br>
<a href="book-Z-H-31.html#%_idx_5544"><tt>perform</tt> (in register machine)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5762">simulating</a><br>
<a href="book-Z-H-32.html#%_idx_5766"><tt>perform-action</tt></a><br>
<a href="book-Z-H-6.html#%_idx_2">Perlis, Alan J.</a>, <a href="book-Z-H-15.html#%_idx_1552">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_208">quips</a>, <a href="book-Z-H-10.html#%_idx_278">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1832">permutations of a set</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1840"><tt>permutations</tt></a><br>
<a href="book-Z-H-28.html#%_idx_4942">Phillips, Hubert</a><br>
<img src="book-Z-G-D-9.gif" border="0">  (pi)
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1094">approximation with half-interval method</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2958">approximation with Monte Carlo integration</a>, <a href="book-Z-H-24.html#%_idx_4140">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2940">Ces&agrave;ro estimate for</a>, 
<a href="book-Z-H-24.html#%_idx_4120">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_974">Leibniz's series for</a>, 
<a href="book-Z-H-24.html#%_idx_3950">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3954">stream of approximations</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1014">Wallis's formula for</a><br>
<a href="book-Z-H-24.html#%_idx_3962"><tt>pi-stream</tt></a><br>
<a href="book-Z-H-12.html#%_idx_978"><tt>pi-sum</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1000">with higher-order procedures</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1030">with <tt>lambda</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1854">picture language</a><br>
<a href="book-Z-H-11.html#%_idx_812">Pingala,  &Aacute;ch&aacute;rya</a><br>
<a href="book-Z-H-23.html#%_idx_3582">pipelining</a><br>
<a href="book-Z-H-9.html#%_idx_52">Pitman, Kent M.</a><br>
<a href="book-Z-H-28.html#%_idx_4866">Planner</a><br>
<a href="book-Z-H-14.html#%_idx_1404">point, represented as a pair</a><br>
pointer
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1530">in box-and-pointer notation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5862">typed</a><br>
<a href="book-Z-H-17.html#%_idx_2452"><tt>polar</tt> package</a><br>
<a href="book-Z-H-17.html#%_idx_2376"><tt>polar?</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2664">poly</a><br>
<a href="book-Z-H-18.html#%_idx_2680"><tt>polynomial</tt> package</a><br>
<a href="book-Z-H-18.html#%_idx_2652">polynomial arithmetic</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2670">addition</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2758">division</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2788">Euclid's Algorithm</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2784">greatest common divisor</a>, 
<a href="book-Z-H-18.html#%_idx_2810">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2682">interfaced to generic arithmetic system</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2672">multiplication</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2812">probabilistic algorithm for GCD</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2780">rational functions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2756">subtraction</a><br>
<a href="book-Z-H-18.html#%_idx_2650">polynomial(s)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2772">canonical form</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2728">dense</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1772">evaluating with Horner's rule</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2766">hierarchy of types</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2656">indeterminate of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2732">sparse</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2660">univariate</a><br>
<a href="book-Z-H-32.html#%_idx_5652"><tt>pop</tt></a><br>
<a href="book-Z-H-9.html#%_idx_66">Portable Standard Lisp</a><br>
<a href="book-Z-H-35.html#%_idx_6504">porting a language</a><br>
<a href="book-Z-H-24.html#%_idx_3910">power series, as stream</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3926">adding</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3934">dividing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3922">integrating</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3928">multiplying</a><br>
<a href="book-Z-H-23.html#%_idx_3712">PowerPC</a><br>
<a href="book-Z-H-10.html#%_idx_390">predicate</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_366">of <tt>cond</tt> clause</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_434">of <tt>if</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_518">naming convention for</a><br>
<a href="book-Z-H-16.html#%_idx_2234">prefix code</a><br>
<a href="book-Z-H-10.html#%_idx_190">prefix notation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2098">infix notation vs.</a><br>
<a href="book-Z-H-28.html#%_idx_4968"><tt>prepositions</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6264"><tt>preserving</tt></a>, 
<a href="book-Z-H-35.html#%_idx_6272">[2]</a>, <a href="book-Z-H-35.html#%_idx_6398">[3]</a>, 
<a href="book-Z-H-35.html#%_idx_6420">[4]</a><br>
<a href="book-Z-H-10.html#%_idx_198">pretty-printing</a><br>
<a href="book-Z-H-11.html#%_idx_858">prime number(s)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_930">cryptography and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3842">Eratosthenes's sieve for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_870">Fermat test for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;infinite stream of, <em>see</em> <tt>primes</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_950">Miller-Rabin test for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_856">testing for</a><br>
<a href="book-Z-H-28.html#%_idx_4814"><tt>prime-sum-pair</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1828"><tt>prime-sum-pairs</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3990">infinite stream</a><br>
<a href="book-Z-H-11.html#%_idx_866"><tt>prime?</tt></a>, <a href="book-Z-H-24.html#%_idx_3874">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3854"><tt>primes</tt> (infinite stream)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3872">implicit definition</a><br>
<a href="book-Z-H-22.html#%_idx_3510">primitive constraints</a><br>
<a href="book-Z-H-10.html#%_idx_120">primitive expression</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_264">evaluation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_158">name of primitive procedure</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_218">name of variable</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_150">number</a><br>
primitive procedures (those marked <em>ns</em> are not in the IEEE Scheme standard)
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_166"><tt>*</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_164"><tt>+</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_172"><tt>-</tt></a>, <a href="book-Z-H-10.html#%_idx_412">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_174"><tt>/</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_400"><tt>&lt;</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_402"><tt>=</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_398"><tt>&gt;</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2460"><tt>apply</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2326"><tt>atan</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1326"><tt>car</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1330"><tt>cdr</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1322"><tt>cons</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1114"><tt>cos</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1360"><tt>display</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2028"><tt>eq?</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1090"><tt>error</tt> (<em>ns</em>)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4574"><tt>eval</tt> (<em>ns</em>)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1570"><tt>list</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1136"><tt>log</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1496"><tt>max</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1492"><tt>min</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1364"><tt>newline</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_464"><tt>not</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1616"><tt>null?</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2054"><tt>number?</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1688"><tt>pair?</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3908"><tt>quotient</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_902"><tt>random</tt> (<em>ns</em>)</a>, 
<a href="book-Z-H-20.html#%_idx_2968">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4524"><tt>read</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_802"><tt>remainder</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2644"><tt>round</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_934"><tt>runtime</tt> (<em>ns</em>)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3142"><tt>set-car!</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3146"><tt>set-cdr!</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1118"><tt>sin</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2062"><tt>symbol?</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5846"><tt>vector-ref</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5850"><tt>vector-set!</tt></a><br>
primitive query, <em>see</em> simple query
<br>
<a href="book-Z-H-34.html#%_idx_6076"><tt>primitive-apply</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4508"><tt>primitive-implementation</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4510"><tt>primitive-procedure-names</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4512"><tt>primitive-procedure-objects</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4442"><tt>primitive-procedure?</tt></a>, 
<a href="book-Z-H-26.html#%_idx_4506">[2]</a><br>
<a href="book-Z-H-17.html#%_idx_2362">principle of least commitment</a><br>
<a href="book-Z-H-31.html#%_idx_5540"><tt>print</tt> operation in register machine</a><br>
<a href="book-Z-H-14.html#%_idx_1410"><tt>print-point</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3260"><tt>print-queue</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1370"><tt>print-rat</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6146"><tt>print-result</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6164">monitored-stack version</a><br>
<a href="book-Z-H-32.html#%_idx_5810"><tt>print-stack-statistics</tt> operation in register machine</a><br>
<a href="book-Z-H-14.html#%_idx_1356">printing, primitives for</a><br>
<a href="book-Z-H-11.html#%_idx_908">probabilistic algorithm</a>, 
<a href="book-Z-H-18.html#%_idx_2814">[2]</a>, <a href="book-Z-H-24.html#%_idx_3850">[3]</a><br>
<tt>probe</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3542">in constraint system</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3432">in digital-circuit simulator</a><br>
<a href="book-Z-H-34.html#%_idx_6026"><tt>proc</tt> register</a><br>
<a href="book-Z-H-10.html#%_idx_574">procedural abstraction</a><br>
<a href="book-Z-H-14.html#%_idx_1448">procedural representation of data</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3202">mutable data</a><br>
<a href="book-Z-H-9.html#%_idx_114">procedure</a>, <a href="book-Z-H-10.html#%_idx_128">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1044">anonymous</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_192">arbitrary number of arguments</a>, 
<a href="book-Z-H-15.html#%_idx_1654">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_968">as argument</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_570">as black box</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_322">body of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_298">compound</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_304">creating with <tt>define</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1038">creating with <tt>lambda</tt></a>, 
<a href="book-Z-H-21.html#%_idx_3070">[2]</a>, <a href="book-Z-H-21.html#%_idx_3074">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_116">as data</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_292">definition of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1224">first-class in Lisp</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_318">formal parameters of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1080">as general method</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2270">generic</a>, <a href="book-Z-H-17.html#%_idx_2294">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;higher-order, <em>see</em> higher-order procedure
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2882">implicit <tt>begin</tt> in body of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_488">mathematical function vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3320">memoized</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2910">monitored</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_312">name of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_302">naming (with <tt>define</tt>)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_630">as pattern for local evolution of a process</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1158">as returned value</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5698">returning multiple values</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_600">scope of formal parameters</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4694">special form vs.</a>, 
<a href="book-Z-H-27.html#%_idx_4766">[2]</a><br>
procedure application
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_180">combination denoting</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3084">environment model of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;substitution model of, <em>see</em> substitution model of procedure application
<br>
<a href="book-Z-H-26.html#%_idx_4450"><tt>procedure-body</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4452"><tt>procedure-environment</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4448"><tt>procedure-parameters</tt></a><br>
<a href="book-Z-H-9.html#%_idx_10">process</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_668">iterative</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_676">linear iterative</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_664">linear recursive</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_634">local evolution of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_754">order of growth of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_656">recursive</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_756">resources required by</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_650">shape of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_714">tree-recursive</a><br>
<a href="book-Z-H-12.html#%_idx_1010"><tt>product</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1022">as accumulation</a><br>
<a href="book-Z-H-16.html#%_idx_2078"><tt>product?</tt></a><br>
<a href="book-Z-H-9.html#%_idx_14">program</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4544">as abstract machine</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1838">comments in</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4540">as data</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_236">incremental development of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_238">structure of</a>, <a href="book-Z-H-10.html#%_idx_566">[2]</a>, 
<a href="book-Z-H-10.html#%_idx_610">[3]</a>, 
<em>see also</em> abstraction barriers
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4564">structured with subroutines</a><br>
<a href="book-Z-H-32.html#%_idx_5664">program counter</a><br>
programming
<br>
&nbsp;&nbsp;&nbsp;&nbsp;data-directed, <em>see</em> data-directed programming
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3792">demand-driven</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_118">elements of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;functional, <em>see</em> functional programming
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_3016">imperative</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3828">odious style</a><br>
<a href="book-Z-H-9.html#%_idx_16">programming language</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4670">design of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4158">functional</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5078">logic</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2624">object-oriented</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4104">strongly typed</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_504">very high-level</a><br>
<a href="book-Z-H-28.html#%_idx_4876">Prolog</a>, <a href="book-Z-H-29.html#%_idx_5056">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4534"><tt>prompt-for-input</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4520">prompts</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6142">explicit-control evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4734">lazy evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4530">metacircular evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_5022">nondeterministic evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5292">query interpreter</a><br>
<a href="book-Z-H-22.html#%_idx_3426"><tt>propagate</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3482">propagation of constraints</a><br>
<a href="book-Z-H-10.html#%_idx_502">proving programs correct</a><br>
<a href="book-Z-H-20.html#%_idx_2926">pseudo-random sequence</a><br>
<a href="book-Z-H-18.html#%_idx_2802">pseudodivision of polynomials</a><br>
<a href="book-Z-H-18.html#%_idx_2804">pseudoremainder of polynomials</a><br>
<a href="book-Z-H-32.html#%_idx_5654"><tt>push</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2438"><tt>put</tt></a>, <a href="book-Z-H-22.html#%_idx_3302">[2]</a><br>
puzzles
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1850">eight-queens puzzle</a>, 
<a href="book-Z-H-28.html#%_idx_4948">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4926">logic puzzles</a><br>
Pythagorean triples
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4912">with nondeterministic programs</a>, 
<a href="book-Z-H-28.html#%_idx_4916">[2]</a>, <a href="book-Z-H-28.html#%_idx_4920">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4004">with streams</a><p>

<p><p>

<br>
<a href="book-Z-H-29.html#%_idx_5228"><tt>qeval</tt></a>, <a href="book-Z-H-29.html#%_idx_5310">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_4186">quantum mechanics</a><br>
<a href="book-Z-H-35.html#%_idx_6284">quasiquote</a><br>
<a href="book-Z-H-15.html#%_idx_1852"><tt>queens</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5092">query</a>, 
<em>see also</em> simple query; compound query
<br>
<a href="book-Z-H-29.html#%_idx_5094">query interpreter</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5242">adding rule or assertion</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;compound query, <em>see</em> compound query
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5372">data base</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5234">driver loop</a>, 
<a href="book-Z-H-29.html#%_idx_5290">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5452">environment structure in</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5178">frame</a>, <a href="book-Z-H-29.html#%_idx_5414">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5282">improvements to</a>, 
<a href="book-Z-H-29.html#%_idx_5426">[2]</a>, <a href="book-Z-H-29.html#%_idx_5432">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5260">infinite loops</a>, 
<a href="book-Z-H-29.html#%_idx_5284">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5302">instantiation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5218">Lisp interpreter vs.</a>, 
<a href="book-Z-H-29.html#%_idx_5230">[2]</a>, <a href="book-Z-H-29.html#%_idx_5446">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5172">overview</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5174">pattern matching</a>, 
<a href="book-Z-H-29.html#%_idx_5340">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5300">pattern-variable representation</a>, 
<a href="book-Z-H-29.html#%_idx_5398">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5266">problems with <tt>not</tt> and <tt>lisp-value</tt></a>, <a href="book-Z-H-29.html#%_idx_5434">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5226">query evaluator</a>, 
<a href="book-Z-H-29.html#%_idx_5306">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;rule, <em>see</em> rule
<br>
&nbsp;&nbsp;&nbsp;&nbsp;simple query, <em>see</em> simple query
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5384">stream operations</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5184">streams of frames</a>, 
<a href="book-Z-H-29.html#%_idx_5238">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5396">syntax of query language</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5208">unification</a>, 
<a href="book-Z-H-29.html#%_idx_5360">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5090">query language</a>, <a href="book-Z-H-29.html#%_idx_5096">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5138">abstraction in</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;compound query, <em>see</em> compound query
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5102">data base</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5134">equality testing in</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5280">extensions to</a>, 
<a href="book-Z-H-29.html#%_idx_5420">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5156">logical deductions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5244">mathematical logic vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;rule, <em>see</em> rule
<br>
&nbsp;&nbsp;&nbsp;&nbsp;simple query, <em>see</em> simple query
<br>
<a href="book-Z-H-29.html#%_idx_5294"><tt>query-driver-loop</tt></a><br>
<a href="book-Z-H-10.html#%_idx_522">question mark, in predicate names</a><br>
<a href="book-Z-H-22.html#%_idx_3220">queue</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3264">double-ended</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3224">front of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3230">operations on</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3262">procedural implementation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3222">rear of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3440">in simulation agenda</a><br>
<a href="book-Z-H-16.html#%_idx_1988">quotation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2004">of character strings</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_1998">of Lisp data objects</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_1992">in natural language</a><br>
<a href="book-Z-H-16.html#%_idx_2002">quotation mark, single vs. double</a><br>
<a href="book-Z-H-16.html#%_idx_2014"><tt>quote</tt> (special form)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4528"><tt>read</tt> and</a>, 
<a href="book-Z-H-29.html#%_idx_5408">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4286"><tt>quoted?</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3906"><tt>quotient</tt> (primitive procedure)</a><p>

<p><p>

<br>
<a href="book-Z-H-11.html#%_idx_958">Rabin, Michael O.</a><br>
<a href="book-Z-H-10.html#%_idx_514">radicand</a><br>
<a href="book-Z-H-24.html#%_idx_4010">Ramanujan numbers</a><br>
<a href="book-Z-H-24.html#%_idx_4014">Ramanujan, Srinivasa</a><br>
<a href="book-Z-H-20.html#%_idx_2934"><tt>rand</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2974">with reset</a><br>
<a href="book-Z-H-11.html#%_idx_900"><tt>random</tt> (primitive procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2852">assignment needed for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2966">MIT Scheme</a><br>
<a href="book-Z-H-20.html#%_idx_2970"><tt>random-in-range</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2854">random-number generator</a>, 
<a href="book-Z-H-20.html#%_idx_2922">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2938">in Monte Carlo simulation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_894">in primality testing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2972">with reset</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4136">with reset, stream version</a><br>
<a href="book-Z-H-24.html#%_idx_4124"><tt>random-numbers</tt> (infinite stream)</a><br>
<a href="book-Z-H-29.html#%_idx_5048">Raphael, Bertram</a><br>
<a href="book-Z-H-18.html#%_idx_2526"><tt>rational</tt> package</a><br>
<a href="book-Z-H-18.html#%_idx_2776">rational function</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2806">reducing to lowest terms</a><br>
rational number(s)
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1296">arithmetic operations on</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_526">in MIT Scheme</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1354">printing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1372">reducing to lowest terms</a>, 
<a href="book-Z-H-14.html#%_idx_1386">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1346">represented as pairs</a><br>
<a href="book-Z-H-14.html#%_idx_1298">rational-number arithmetic</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2528">interfaced to generic arithmetic system</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-13.html#%_idx_1260">need for compound data</a><br>
<a href="book-Z-H-27.html#%_idx_4678">Raymond, Eric</a>, <a href="book-Z-H-28.html#%_idx_4850">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_4028">RC circuit</a><br>
<a href="book-Z-H-26.html#%_idx_4522"><tt>read</tt> (primitive procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5352">dotted-tail notation handling by</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5404">macro characters</a><br>
<a href="book-Z-H-31.html#%_idx_5538"><tt>read</tt> operation in register machine</a><br>
<a href="book-Z-H-10.html#%_idx_204">read-eval-print loop</a>, 
<em>see also</em> driver loop
<br>
<a href="book-Z-H-34.html#%_idx_6144"><tt>read-eval-print-loop</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5402">reader macro character</a><br>
<a href="book-Z-H-10.html#%_idx_138">real number</a><br>
<tt>real-part</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2464">data-directed</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2344">polar representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2328">rectangular representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2406">with tagged data</a><br>
<a href="book-Z-H-17.html#%_idx_2390"><tt>real-part-polar</tt></a><br>
<a href="book-Z-H-17.html#%_idx_2378"><tt>real-part-rectangular</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3244"><tt>rear-ptr</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5690"><tt>receive</tt> procedure</a><br>
<a href="book-Z-H-16.html#%_idx_2204">record, in a data base</a><br>
<a href="book-Z-H-14.html#%_idx_1412">rectangle, representing</a><br>
<a href="book-Z-H-17.html#%_idx_2446"><tt>rectangular</tt> package</a><br>
<a href="book-Z-H-17.html#%_idx_2374"><tt>rectangular?</tt></a><br>
<a href="book-Z-H-10.html#%_idx_248">recursion</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2722">data-directed</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_250">expressing complicated process</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5150">in rules</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1680">in working with trees</a><br>
<a href="book-Z-H-9.html#%_idx_26">recursion equations</a><br>
<a href="book-Z-H-26.html#%_idx_4568">recursion theory</a><br>
recursive procedure
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_564">recursive procedure definition</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_680">recursive process vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4624">specifying without <tt>define</tt></a><br>
<a href="book-Z-H-11.html#%_idx_654">recursive process</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_638">iterative process vs.</a>, 
<a href="book-Z-H-21.html#%_idx_3090">[2]</a>, <a href="book-Z-H-31.html#%_idx_5568">[3]</a>, 
<a href="book-Z-H-35.html#%_idx_6410">[4]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_660">linear</a>, <a href="book-Z-H-11.html#%_idx_766">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_682">recursive procedure vs.</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5564">register machine for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_716">tree</a>, <a href="book-Z-H-11.html#%_idx_778">[2]</a><br>
<a href="book-Z-H-16.html#%_idx_2174">red-black tree</a><br>
<a href="book-Z-H-14.html#%_idx_1374">reducing to lowest terms</a>, 
<a href="book-Z-H-14.html#%_idx_1388">[2]</a>, <a href="book-Z-H-18.html#%_idx_2808">[3]</a><br>
<a href="book-Z-H-26.html#%_idx_4380">Rees, Jonathan A.</a>, 
<a href="book-Z-H-26.html#%_idx_4644">[2]</a><br>
<a href="book-Z-H-20.html#%_idx_2990">referential transparency</a><br>
<a href="book-Z-H-31.html#%_idx_5526"><tt>reg</tt> (in register machine)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5768">simulating</a><br>
<a href="book-Z-H-30.html#%_idx_5458">register machine</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5536">actions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5466">controller</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5486">controller diagram</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5464">data paths</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5480">data-path diagram</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5462">design of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5492">language for describing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5804">monitoring performance</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5622">simulator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5562">stack</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5550">subroutine</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5484">test operation</a><br>
<a href="book-Z-H-32.html#%_idx_5658">register table, in simulator</a><br>
<a href="book-Z-H-30.html#%_idx_5460">register(s)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5640">representing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5822">tracing</a><br>
<a href="book-Z-H-32.html#%_idx_5776"><tt>register-exp</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5778"><tt>register-exp-reg</tt></a><br>
register-machine language
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5516"><tt>assign</tt></a>, 
<a href="book-Z-H-31.html#%_idx_5598">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5504"><tt>branch</tt></a>, 
<a href="book-Z-H-31.html#%_idx_5606">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5528"><tt>const</tt></a>, 
<a href="book-Z-H-31.html#%_idx_5596">[2]</a>, <a href="book-Z-H-31.html#%_idx_5616">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5498">entry point</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5512"><tt>goto</tt></a>, <a href="book-Z-H-31.html#%_idx_5610">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5494">instructions</a>, 
<a href="book-Z-H-31.html#%_idx_5592">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5496">label</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5508"><tt>label</tt></a>, 
<a href="book-Z-H-31.html#%_idx_5608">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5520"><tt>op</tt></a>, <a href="book-Z-H-31.html#%_idx_5600">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5542"><tt>perform</tt></a>, 
<a href="book-Z-H-31.html#%_idx_5602">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5524"><tt>reg</tt></a>, <a href="book-Z-H-31.html#%_idx_5594">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5578"><tt>restore</tt></a>, 
<a href="book-Z-H-31.html#%_idx_5614">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5574"><tt>save</tt></a>, <a href="book-Z-H-31.html#%_idx_5612">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5500"><tt>test</tt></a>, <a href="book-Z-H-31.html#%_idx_5604">[2]</a><br>
<a href="book-Z-H-32.html#%_idx_5624">register-machine simulator</a><br>
<a href="book-Z-H-35.html#%_idx_6382"><tt>registers-modified</tt></a><br>
<a href="book-Z-H-35.html#%_idx_6380"><tt>registers-needed</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3508">relations, computing in terms of</a>, 
<a href="book-Z-H-29.html#%_idx_5038">[2]</a><br>
<a href="book-Z-H-12.html#%_idx_1028">relatively prime</a><br>
<a href="book-Z-H-23.html#%_idx_3724">relativity, theory of</a><br>
<a href="book-Z-H-23.html#%_idx_3644">release a mutex</a><br>
<a href="book-Z-H-11.html#%_idx_800"><tt>remainder</tt> (primitive procedure)</a><br>
<a href="book-Z-H-11.html#%_idx_890">remainder modulo <em>n</em></a><br>
<a href="book-Z-H-18.html#%_idx_2796"><tt>remainder-terms</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1842"><tt>remove</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3418"><tt>remove-first-agenda-item!</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3478">[2]</a><br>
<a href="book-Z-H-28.html#%_idx_4828"><tt>require</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_5026">as a special form</a><br>
<a href="book-Z-H-35.html#%_idx_6426">reserved words</a>, <a href="book-Z-H-35.html#%_idx_6462">[2]</a><br>
resistance
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1482">formula for parallel resistors</a>, 
<a href="book-Z-H-14.html#%_idx_1524">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1484">tolerance of resistors</a><br>
<a href="book-Z-H-29.html#%_idx_5046">resolution principle</a><br>
<a href="book-Z-H-29.html#%_idx_5060">resolution, Horn-clause</a><br>
<a href="book-Z-H-26.html#%_idx_4334"><tt>rest-exps</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4350"><tt>rest-operands</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3468"><tt>rest-segments</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2700"><tt>rest-terms</tt></a>, 
<a href="book-Z-H-18.html#%_idx_2740">[2]</a><br>
<a href="book-Z-H-31.html#%_idx_5580"><tt>restore</tt> (in register machine)</a>, 
<a href="book-Z-H-32.html#%_idx_5800">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5922">implementing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5758">simulating</a><br>
<a href="book-Z-H-35.html#%_idx_6254"><tt>return</tt> (linkage descriptor)</a><br>
<a href="book-Z-H-32.html#%_idx_5696">returning multiple values</a><br>
<a href="book-Z-H-23.html#%_idx_3706">Reuter, Andreas</a><br>
<a href="book-Z-H-15.html#%_idx_1642"><tt>reverse</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1816">as folding</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5286">rules</a><br>
<a href="book-Z-H-11.html#%_idx_824">Rhind Papyrus</a><br>
<a href="book-Z-H-16.html#%_idx_2156"><tt>right-branch</tt></a>, 
<a href="book-Z-H-16.html#%_idx_2262">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1890"><tt>right-split</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3388">ripple-carry adder</a><br>
<a href="book-Z-H-11.html#%_idx_922">Rivest, Ronald L.</a>, 
<a href="book-Z-H-16.html#%_idx_2180">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_4086">RLC circuit</a><br>
<a href="book-Z-H-29.html#%_idx_5068">Robinson, J. A.</a><br>
<a href="book-Z-H-15.html#%_idx_1982">robustness</a><br>
<a href="book-Z-H-16.html#%_idx_2282">rock songs, 1950s</a><br>
<a href="book-Z-H-15.html#%_idx_1868">Rogers, William Barton</a><br>
<a href="book-Z-H-33.html#%_idx_5966"><tt>root</tt> register</a><br>
roots of equation, <em>see</em> half-interval method; Newton's method
<br>
<a href="book-Z-H-15.html#%_idx_1968"><tt>rotate90</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2642"><tt>round</tt> (primitive procedure)</a><br>
<a href="book-Z-H-10.html#%_idx_144">roundoff error</a>, <a href="book-Z-H-17.html#%_idx_2308">[2]</a><br>
<a href="book-Z-H-35.html#%_idx_6370">Rozas, Guillermo Juan</a><br>
<a href="book-Z-H-11.html#%_idx_928">RSA algorithm</a><br>
<a href="book-Z-H-29.html#%_idx_5136">rule (query language)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5216">applying</a>, <a href="book-Z-H-29.html#%_idx_5356">[2]</a>, 
<a href="book-Z-H-29.html#%_idx_5454">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5146">without body</a>, 
<a href="book-Z-H-29.html#%_idx_5160">[2]</a>, <a href="book-Z-H-29.html#%_idx_5336">[3]</a><br>
<a href="book-Z-H-15.html#%_idx_1870">Runkle, John Daniel</a><br>
<a href="book-Z-H-11.html#%_idx_932"><tt>runtime</tt> (primitive procedure)</a><br>
<a href="book-Z-H-11.html#%_idx_820">Russian peasant method of multiplication</a><p>

<p><p>

<br>
<a href="book-Z-H-29.html#%_idx_5142"><tt>same</tt> (rule)</a><br>
<a href="book-Z-H-16.html#%_idx_2066"><tt>same-variable?</tt></a>, 
<a href="book-Z-H-18.html#%_idx_2668">[2]</a><br>
sameness and change
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2986">meaning of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3180">shared data and</a><br>
<a href="book-Z-H-29.html#%_idx_5126">satisfy a compound query</a><br>
<a href="book-Z-H-29.html#%_idx_5118">satisfy a pattern (simple query)</a><br>
<a href="book-Z-H-31.html#%_idx_5576"><tt>save</tt> (in register machine)</a>, 
<a href="book-Z-H-32.html#%_idx_5802">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5920">implementing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5752">simulating</a><br>
<a href="book-Z-H-15.html#%_idx_1662"><tt>scale-list</tt></a>, 
<a href="book-Z-H-15.html#%_idx_1668">[2]</a>, <a href="book-Z-H-27.html#%_idx_4784">[3]</a><br>
<a href="book-Z-H-24.html#%_idx_3870"><tt>scale-stream</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1708"><tt>scale-tree</tt></a>, 
<a href="book-Z-H-15.html#%_idx_1710">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1942"><tt>scale-vect</tt></a><br>
<a href="book-Z-H-33.html#%_idx_5978"><tt>scan</tt> register</a><br>
<a href="book-Z-H-26.html#%_idx_4614"><tt>scan-out-defines</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4606">scanning out internal definitions</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6446">in compiler</a>, 
<a href="book-Z-H-35.html#%_idx_6454">[2]</a><br>
<a href="book-Z-H-9.html#%_idx_42">Scheme</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-9.html#%_idx_86">history of</a><br>
<a href="book-Z-H-34.html#%_idx_5998">Scheme chip</a>, <a href="book-Z-H-34.html#%_idx_6010">[2]</a><br>
<a href="book-Z-H-18.html#%_idx_2518"><tt>scheme-number</tt> package</a><br>
<a href="book-Z-H-18.html#%_idx_2584"><tt>scheme-number-&gt;complex</tt></a><br>
<a href="book-Z-H-18.html#%_idx_2628"><tt>scheme-number-&gt;scheme-number</tt></a><br>
<a href="book-Z-H-20.html#%_idx_3010">Schmidt, Eric</a><br>
<a href="book-Z-H-10.html#%_idx_594">scope of a variable</a>, 
<em>see also</em> lexical scoping
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4602">internal <tt>define</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1072">in <tt>let</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_602">procedure's formal parameters</a><br>
search
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2146">of binary tree</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4856">depth-first</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4844">systematic</a><br>
<a href="book-Z-H-12.html#%_idx_1084"><tt>search</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5108">secretary, importance of</a><br>
<a href="book-Z-H-22.html#%_idx_3446"><tt>segment-queue</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3444"><tt>segment-time</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3462"><tt>segments</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1950"><tt>segments-&gt;painter</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1290">selector</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1384">as abstraction barrier</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2402">generic</a>, <a href="book-Z-H-17.html#%_idx_2420">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4240">self-evaluating expression</a><br>
<a href="book-Z-H-26.html#%_idx_4282"><tt>self-evaluating?</tt></a><br>
<a href="book-Z-H-23.html#%_idx_3648">semaphore</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3692">of size <em>n</em></a><br>
<a href="book-Z-H-10.html#%_idx_284">semicolon</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1834">comment introduced by</a><br>
<a href="book-Z-H-16.html#%_idx_2232">separator code</a><br>
<a href="book-Z-H-24.html#%_idx_3966">sequence accelerator</a><br>
sequence of expressions
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_444">in consequent of <tt>cond</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_326">in procedure body</a><br>
<a href="book-Z-H-15.html#%_idx_1554">sequence(s)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1718">as conventional interface</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1758">as source of modularity</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1738">operations on</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1556">represented by pairs</a><br>
<a href="book-Z-H-26.html#%_idx_4336"><tt>sequence-&gt;exp</tt></a><br>
<a href="book-Z-H-23.html#%_idx_3634"><tt>serialized-exchange</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3708">with deadlock avoidance</a><br>
<a href="book-Z-H-23.html#%_idx_3610">serializer</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3638">implementing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3622">with multiple shared resources</a><br>
<a href="book-Z-H-12.html#%_idx_982">series, summation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3964">accelerating sequence of approximations</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3956">with streams</a><br>
<a href="book-Z-H-16.html#%_idx_2100">set</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<tt>set
<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</tt> (special form), <em>see also</em> assignment
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2200">data base as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2102">operations on</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1830">permutations of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2136">represented as binary tree</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2124">represented as ordered list</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2112">represented as unordered list</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1714">subsets of</a><br>
<a href="book-Z-H-20.html#%_idx_2860"><tt>set!</tt> (special form)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3080">environment model of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2864">value of</a><br>
<a href="book-Z-H-22.html#%_idx_3140"><tt>set-car!</tt> (primitive procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5900">implemented with vectors</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3216">procedural implementation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3148">value of</a><br>
<a href="book-Z-H-22.html#%_idx_3144"><tt>set-cdr!</tt> (primitive procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5902">implemented with vectors</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3218">procedural implementation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3152">value of</a><br>
<a href="book-Z-H-32.html#%_idx_5646"><tt>set-contents!</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3460"><tt>set-current-time!</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3246"><tt>set-front-ptr!</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5710"><tt>set-instruction-execution-proc!</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3248"><tt>set-rear-ptr!</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5628"><tt>set-register-contents!</tt></a>, 
<a href="book-Z-H-32.html#%_idx_5678">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3464"><tt>set-segments!</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3372"><tt>set-signal!</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3406">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3526"><tt>set-value!</tt></a>, 
<a href="book-Z-H-22.html#%_idx_3554">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4462"><tt>set-variable-value!</tt></a>, 
<a href="book-Z-H-26.html#%_idx_4482">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4502"><tt>setup-environment</tt></a><br>
<a href="book-Z-H-21.html#%_idx_3060">shadow a binding</a><br>
<a href="book-Z-H-11.html#%_idx_924">Shamir, Adi</a><br>
<a href="book-Z-H-11.html#%_idx_648">shape of a process</a><br>
<a href="book-Z-H-22.html#%_idx_3178">shared data</a><br>
<a href="book-Z-H-23.html#%_idx_3624">shared resources</a><br>
<a href="book-Z-H-23.html#%_idx_3598">shared state</a><br>
<a href="book-Z-H-15.html#%_idx_1966"><tt>shrink-to-upper-right</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5088">Shrobe, Howard E.</a><br>
<a href="book-Z-H-20.html#%_idx_3000">side-effect bug</a><br>
<a href="book-Z-H-24.html#%_idx_3844">sieve of Eratosthenes</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3852"><tt>sieve</tt></a><br>
<a href="book-Z-H-12.html#%_idx_988">sum  (sigma) notation</a><br>
signal processing
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1236">smoothing a function</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4042">smoothing a signal</a>, 
<a href="book-Z-H-24.html#%_idx_4050">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4018">stream model of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4034">zero crossings of a signal</a>, 
<a href="book-Z-H-24.html#%_idx_4038">[2]</a>, <a href="book-Z-H-24.html#%_idx_4046">[3]</a><br>
<a href="book-Z-H-22.html#%_idx_3336">signal, digital</a><br>
<a href="book-Z-H-34.html#%_idx_6156"><tt>signal-error</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1728">signal-flow diagram</a>, 
<a href="book-Z-H-24.html#%_idx_4026">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1726">signal-processing view of computation</a><br>
<a href="book-Z-H-29.html#%_idx_5110">simple query</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5182">processing</a>, <a href="book-Z-H-29.html#%_idx_5194">[2]</a>, 
<a href="book-Z-H-29.html#%_idx_5220">[3]</a>, <a href="book-Z-H-29.html#%_idx_5312">[4]</a><br>
<a href="book-Z-H-29.html#%_idx_5314"><tt>simple-query</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2086">simplification of algebraic expressions</a><br>
<a href="book-Z-H-12.html#%_idx_1006">Simpson's Rule for numerical integration</a><br>
simulation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;of digital circuit, <em>see</em> digital-circuit simulation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3332">event-driven</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6162">as machine-design tool</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5806">for monitoring performance of register machine</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;Monte Carlo, <em>see</em> Monte Carlo simulation
<br>
&nbsp;&nbsp;&nbsp;&nbsp;of register machine, <em>see</em> register-machine simulator
<br>
<a href="book-Z-H-12.html#%_idx_1116"><tt>sin</tt> (primitive procedure)</a><br>
sine
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_786">approximation for small angle</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3918">power series for</a><br>
<a href="book-Z-H-29.html#%_idx_5394"><tt>singleton-stream</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3486">SKETCHPAD</a><br>
<a href="book-Z-H-11.html#%_idx_860"><tt>smallest-divisor</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_942">more efficient version</a><br>
<a href="book-Z-H-22.html#%_idx_3490">Smalltalk</a><br>
<a href="book-Z-H-12.html#%_idx_1234">smoothing a function</a><br>
<a href="book-Z-H-24.html#%_idx_4044">smoothing a signal</a>, 
<a href="book-Z-H-24.html#%_idx_4052">[2]</a><br>
<a href="book-Z-H-27.html#%_idx_4674">snarf</a><br>
<a href="book-Z-H-9.html#%_idx_102">Solar System's chaotic dynamics</a><br>
<a href="book-Z-H-20.html#%_idx_2930">Solomonoff, Ray</a><br>
<a href="book-Z-H-24.html#%_idx_4066"><tt>solve</tt> differential equation</a>, 
<a href="book-Z-H-24.html#%_idx_4076">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4804">lazy-list version</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4616">with scanned-out definitions</a><br>
solving equation, <em>see</em> half-interval method; Newton's method; <tt>solve</tt>
<br>
<a href="book-Z-H-35.html#%_idx_6214">source language</a><br>
<a href="book-Z-H-35.html#%_idx_6216">source program</a><br>
<a href="book-Z-H-35.html#%_idx_6502">Spafford, Eugene H.</a><br>
<a href="book-Z-H-18.html#%_idx_2730">sparse polynomial</a><br>
<a href="book-Z-H-10.html#%_idx_272">special form</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4358">as derived expression in evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_558">need for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4692">procedure vs.</a>, 
<a href="book-Z-H-27.html#%_idx_4764">[2]</a><br>
special forms (those marked <em>ns</em> are not in the IEEE Scheme standard)
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_448"><tt>and</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2876"><tt>begin</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_354"><tt>cond</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3776"><tt>cons-stream</tt> (<em>ns</em>)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_226"><tt>define</tt></a>, <a href="book-Z-H-10.html#%_idx_308">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3770"><tt>delay</tt> (<em>ns</em>)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_422"><tt>if</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1036"><tt>lambda</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1064"><tt>let</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4410"><tt>let*</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4620"><tt>letrec</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4418">named <tt>let</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_456"><tt>or</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2016"><tt>quote</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2862"><tt>set!</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1908"><tt>split</tt></a><br>
<a href="book-Z-H-10.html#%_idx_550"><tt>sqrt</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_624">block structured</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3118">in environment model</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1126">as fixed point</a>, 
<a href="book-Z-H-12.html#%_idx_1170">[2]</a>, <a href="book-Z-H-12.html#%_idx_1210">[3]</a>, 
<a href="book-Z-H-12.html#%_idx_1214">[4]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1248">as iterative improvement</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1202">with Newton's method</a>, 
<a href="book-Z-H-12.html#%_idx_1216">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5548">register machine for</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3980">as stream limit</a><br>
<a href="book-Z-H-24.html#%_idx_3948"><tt>sqrt-stream</tt></a><br>
<a href="book-Z-H-10.html#%_idx_294"><tt>square</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3072">in environment model</a><br>
<a href="book-Z-H-10.html#%_idx_508">square root</a>, <em>see also</em> <tt>sqrt</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3946">stream of approximations</a><br>
<a href="book-Z-H-15.html#%_idx_1894"><tt>square-limit</tt></a>, 
<a href="book-Z-H-15.html#%_idx_1906">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1900"><tt>square-of-four</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3562"><tt>squarer</tt> (constraint)</a>, 
<a href="book-Z-H-22.html#%_idx_3564">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1970"><tt>squash-inwards</tt></a><br>
<a href="book-Z-H-11.html#%_idx_678">stack</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6054">framed</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-31.html#%_idx_5560">for recursion in register machine</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5648">representing</a>, 
<a href="book-Z-H-33.html#%_idx_5918">[2]</a><br>
<a href="book-Z-H-35.html#%_idx_6362">stack allocation and tail recursion</a><br>
<a href="book-Z-H-32.html#%_idx_5760"><tt>stack-inst-reg-name</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3498">Stallman, Richard M.</a>, 
<a href="book-Z-H-28.html#%_idx_4886">[2]</a><br>
<a href="book-Z-H-32.html#%_idx_5632"><tt>start</tt> register machine</a>, 
<a href="book-Z-H-32.html#%_idx_5674">[2]</a><br>
<a href="book-Z-H-35.html#%_idx_6478"><tt>start-eceval</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1400"><tt>start-segment</tt></a>, 
<a href="book-Z-H-15.html#%_idx_1956">[2]</a><br>
state
<br>
&nbsp;&nbsp;&nbsp;&nbsp;local, <em>see</em> local state
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3596">shared</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4154">vanishes in stream formulation</a><br>
<a href="book-Z-H-11.html#%_idx_670">state variable</a>, <a href="book-Z-H-20.html#%_idx_2840">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2846">local</a><br>
statements, <em>see</em> instruction sequence
<br>
<a href="book-Z-H-35.html#%_idx_6384"><tt>statements</tt></a><br>
<a href="book-Z-H-9.html#%_idx_88">Steele, Guy Lewis Jr.</a>, 
<a href="book-Z-H-11.html#%_idx_700">[2]</a>, <a href="book-Z-H-20.html#%_idx_3024">[3]</a>, 
<a href="book-Z-H-22.html#%_idx_3500">[4]</a>, <a href="book-Z-H-27.html#%_idx_4676">[5]</a>, 
<a href="book-Z-H-28.html#%_idx_4848">[6]</a><br>
<a href="book-Z-H-33.html#%_idx_5932">stop-and-copy garbage collector</a><br>
<a href="book-Z-H-10.html#%_idx_338">Stoy, Joseph E.</a>, <a href="book-Z-H-11.html#%_idx_830">[2]</a>, 
<a href="book-Z-H-26.html#%_idx_4630">[3]</a><br>
<a href="book-Z-H-12.html#%_idx_1220">Strachey, Christopher</a><br>
<a href="book-Z-H-15.html#%_idx_1978">stratified design</a><br>
<a href="book-Z-H-19.html#%_idx_2830">stream(s)</a>, <a href="book-Z-H-24.html#%_idx_3726">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4054">delayed evaluation and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3746">empty</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3732">implemented as delayed lists</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4754">implemented as lazy lists</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3860">implicit definition</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;infinite, <em>see</em> infinite streams
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5186">used in query interpreter</a>, 
<a href="book-Z-H-29.html#%_idx_5236">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3994"><tt>stream-append</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5386"><tt>stream-append-delayed</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3740"><tt>stream-car</tt></a>, 
<a href="book-Z-H-24.html#%_idx_3780">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3742"><tt>stream-cdr</tt></a>, 
<a href="book-Z-H-24.html#%_idx_3782">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3788"><tt>stream-enumerate-interval</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3790"><tt>stream-filter</tt></a><br>
<a href="book-Z-H-29.html#%_idx_5390"><tt>stream-flatmap</tt></a>, 
<a href="book-Z-H-29.html#%_idx_5418">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3762"><tt>stream-for-each</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3978"><tt>stream-limit</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3760"><tt>stream-map</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3824">with multiple arguments</a><br>
<a href="book-Z-H-24.html#%_idx_3750"><tt>stream-null?</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3754">in MIT Scheme</a><br>
<a href="book-Z-H-24.html#%_idx_3758"><tt>stream-ref</tt></a><br>
<a href="book-Z-H-24.html#%_idx_4152"><tt>stream-withdraw</tt></a><br>
<a href="book-Z-H-27.html#%_idx_4688">strict</a><br>
string, <em>see</em> character string
<br>
<a href="book-Z-H-24.html#%_idx_4102">strongly typed language</a><br>
<a href="book-Z-H-18.html#%_idx_2506"><tt>sub</tt> (generic)</a><br>
<a href="book-Z-H-17.html#%_idx_2314"><tt>sub-complex</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1508"><tt>sub-interval</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1310"><tt>sub-rat</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1940"><tt>sub-vect</tt></a><br>
<a href="book-Z-H-31.html#%_idx_5552">subroutine in register machine</a><br>
<a href="book-Z-H-15.html#%_idx_1716"><tt>subsets</tt> of a set</a><br>
<a href="book-Z-H-10.html#%_idx_334">substitution model of procedure application</a>, <a href="book-Z-H-21.html#%_idx_3036">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2980">inadequacy of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_644">shape of process</a><br>
<a href="book-Z-H-18.html#%_idx_2596">subtype</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2620">multiple</a><br>
<a href="book-Z-H-28.html#%_idx_4988">success continuation (nondeterministic evaluator)</a>, <a href="book-Z-H-28.html#%_idx_4996">[2]</a><br>
<a href="book-Z-H-11.html#%_idx_796">successive squaring</a><br>
<a href="book-Z-H-12.html#%_idx_990"><tt>sum</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1020">as accumulation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1008">iterative version</a><br>
<a href="book-Z-H-12.html#%_idx_972"><tt>sum-cubes</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_994">with higher-order procedures</a><br>
<a href="book-Z-H-12.html#%_idx_970"><tt>sum-integers</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_998">with higher-order procedures</a><br>
<a href="book-Z-H-15.html#%_idx_1722"><tt>sum-odd-squares</tt></a>, 
<a href="book-Z-H-15.html#%_idx_1752">[2]</a><br>
<a href="book-Z-H-10.html#%_idx_330"><tt>sum-of-squares</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3086">in environment model</a><br>
<a href="book-Z-H-24.html#%_idx_3734"><tt>sum-primes</tt></a>, 
<a href="book-Z-H-24.html#%_idx_3736">[2]</a><br>
<a href="book-Z-H-16.html#%_idx_2072"><tt>sum?</tt></a><br>
<a href="book-Z-H-12.html#%_idx_984">summation of a series</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3958">with streams</a><br>
<a href="book-Z-H-18.html#%_idx_2600">supertype</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2618">multiple</a><br>
<a href="book-Z-H-9.html#%_idx_90">Sussman, Gerald Jay</a>, 
<a href="book-Z-H-9.html#%_idx_108">[2]</a>, <a href="book-Z-H-11.html#%_idx_702">[3]</a>, 
<a href="book-Z-H-22.html#%_idx_3496">[4]</a>, <a href="book-Z-H-28.html#%_idx_4868">[5]</a>, 
<a href="book-Z-H-28.html#%_idx_4880">[6]</a>, <a href="book-Z-H-28.html#%_idx_4884">[7]</a><br>
<a href="book-Z-H-16.html#%_idx_1990">Sussman, Julie Esther Mazel, nieces of</a><br>
<a href="book-Z-H-22.html#%_idx_3488">Sutherland, Ivan</a><br>
<a href="book-Z-H-16.html#%_idx_1986">symbol(s)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2024">equality of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5890">interning</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2010">quotation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5882">representation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3184">uniqueness of</a><br>
<a href="book-Z-H-16.html#%_idx_2254"><tt>symbol-leaf</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2060"><tt>symbol?</tt> (primitive procedure)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2556">data types and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5914">implemented with typed pointers</a><br>
<a href="book-Z-H-18.html#%_idx_2646">symbolic algebra</a><br>
<a href="book-Z-H-16.html#%_idx_2044">symbolic differentiation</a>, 
<a href="book-Z-H-17.html#%_idx_2476">[2]</a><br>
<a href="book-Z-H-13.html#%_idx_1270">symbolic expression</a>, 
<em>see also</em> symbol(s)
<br>
<a href="book-Z-H-16.html#%_idx_2264"><tt>symbols</tt></a><br>
<a href="book-Z-H-23.html#%_idx_3714">SYNC</a><br>
synchronization, <em>see</em> concurrency
<br>
syntactic analysis, separated from execution
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4634">in metacircular evaluator</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5684">in register-machine simulator</a>, 
<a href="book-Z-H-32.html#%_idx_5730">[2]</a><br>
<a href="book-Z-H-10.html#%_idx_282">syntactic sugar</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-26.html#%_idx_4298"><tt>define</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1066"><tt>let</tt> as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_696">looping constructs as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3400">procedure vs. data as</a><br>
syntax, <em>see also</em> special forms
<br>
&nbsp;&nbsp;&nbsp;&nbsp;abstract, <em>see</em> abstract syntax
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_316">of expressions, describing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_276">of a programming language</a><br>
<a href="book-Z-H-22.html#%_idx_3402">syntax interface</a><br>
<a href="book-Z-H-28.html#%_idx_4842">systematic search</a><p>

<p><p>

<br>
<a href="book-Z-H-10.html#%_idx_374"><tt>#t</tt></a><br>
<a href="book-Z-H-22.html#%_idx_3268">table</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3274">backbone of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2586">for coercion</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2434">for data-directed programming</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3294">local</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3308"><em>n</em>-dimensional</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3272">one-dimensional</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;operation-and-type, <em>see</em> operation-and-type table
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3312">represented as binary tree vs. unordered list</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3304">testing equality of keys</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3288">two-dimensional</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3448">used in simulation agenda</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3318">used to store computed values</a><br>
<a href="book-Z-H-24.html#%_idx_3972">tableau</a><br>
<a href="book-Z-H-11.html#%_idx_734">tabulation</a>, <a href="book-Z-H-22.html#%_idx_3316">[2]</a><br>
<a href="book-Z-H-35.html#%_idx_6400"><tt>tack-on-instruction-sequence</tt></a><br>
<a href="book-Z-H-33.html#%_idx_5872">tagged architecture</a><br>
<a href="book-Z-H-17.html#%_idx_2358">tagged data</a>, <a href="book-Z-H-33.html#%_idx_5864">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4290"><tt>tagged-list?</tt></a><br>
<a href="book-Z-H-11.html#%_idx_692">tail recursion</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6354">compiler and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3096">environment model of evaluation and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6090">explicit-control evaluator and</a>, 
<a href="book-Z-H-34.html#%_idx_6168">[2]</a>, <a href="book-Z-H-34.html#%_idx_6176">[3]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6358">garbage collection and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-34.html#%_idx_6096">metacircular evaluator and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_706">in Scheme</a><br>
<a href="book-Z-H-34.html#%_idx_6092">tail-recursive evaluator</a><br>
tangent
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-12.html#%_idx_1154">as continued fraction</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3940">power series for</a><br>
<a href="book-Z-H-35.html#%_idx_6248">target register</a><br>
<a href="book-Z-H-23.html#%_idx_3652">Technological University of Eindhoven</a><br>
<a href="book-Z-H-9.html#%_idx_60">Teitelman, Warren</a><br>
<a href="book-Z-H-18.html#%_idx_2666">term list of polynomial</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2724">representing</a><br>
<a href="book-Z-H-18.html#%_idx_2690"><tt>term-list</tt></a><br>
<a href="book-Z-H-10.html#%_idx_260">terminal node of a tree</a><br>
<a href="book-Z-H-31.html#%_idx_5502"><tt>test</tt> (in register machine)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5734">simulating</a><br>
<a href="book-Z-H-31.html#%_idx_5482">test operation in register machine</a><br>
<a href="book-Z-H-23.html#%_idx_3670"><tt>test-and-set!</tt></a>, 
<a href="book-Z-H-23.html#%_idx_3680">[2]</a><br>
<a href="book-Z-H-32.html#%_idx_5738"><tt>test-condition</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4288"><tt>text-of-quotation</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1432">Thatcher, James W.</a><br>
<a href="book-Z-H-23.html#%_idx_3650">THE Multiprogramming System</a><br>
<tt>the-cars</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5892">register</a>, <a href="book-Z-H-33.html#%_idx_5968">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5856">vector</a><br>
<tt>the-cdrs</tt>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5894">register</a>, <a href="book-Z-H-33.html#%_idx_5970">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-33.html#%_idx_5858">vector</a><br>
<a href="book-Z-H-24.html#%_idx_3748"><tt>the-empty-stream</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3752">in MIT Scheme</a><br>
<a href="book-Z-H-18.html#%_idx_2692"><tt>the-empty-termlist</tt></a>, 
<a href="book-Z-H-18.html#%_idx_2736">[2]</a><br>
<a href="book-Z-H-26.html#%_idx_4504"><tt>the-global-environment</tt></a>, 
<a href="book-Z-H-34.html#%_idx_6138">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5042">theorem proving (automatic)</a><br>
<a href="book-Z-H-11.html#%_idx_758"><img src="book-Z-G-D-4.gif" border="0"> (<em>f</em>(<em>n</em>)) (theta of <em>f</em>(<em>n</em>))</a><br>
<a href="book-Z-H-27.html#%_idx_4696">thunk</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3818">call-by-name</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_3820">call-by-need</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4706">forcing</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4738">implementation of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4698">origin of name</a><br>
time
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3580">assignment and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3720">communication and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3584">in concurrent systems</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-24.html#%_idx_4144">functional programming and</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-28.html#%_idx_4820">in nondeterministic computing</a>, 
<a href="book-Z-H-28.html#%_idx_4834">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3586">purpose of</a><br>
<a href="book-Z-H-22.html#%_idx_3438">time segment, in agenda</a><br>
<a href="book-Z-H-23.html#%_idx_3674">time slicing</a><br>
<a href="book-Z-H-11.html#%_idx_936"><tt>timed-prime-test</tt></a><br>
<a href="book-Z-H-23.html#%_idx_3602">timing diagram</a><br>
<a href="book-Z-H-22.html#%_idx_3502">TK!Solver</a><br>
<a href="book-Z-H-18.html#%_idx_2604">tower of types</a><br>
tracing
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5820">instruction execution</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-32.html#%_idx_5824">register assignment</a><br>
<a href="book-Z-H-15.html#%_idx_1962"><tt>transform-painter</tt></a><br>
<a href="book-Z-H-20.html#%_idx_2992">transparency, referential</a><br>
<a href="book-Z-H-15.html#%_idx_1806"><tt>transpose</tt> a matrix</a><br>
tree
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2168">B-tree</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2140">binary</a>, 
<em>see also</em> binary tree
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_254">combination viewed as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1684">counting leaves of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1748">enumerating leaves of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1698">fringe of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2242">Huffman</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-27.html#%_idx_4796">lazy</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1704">mapping over</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2170">red-black</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1676">represented as pairs</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1694">reversing at all levels</a><br>
<a href="book-Z-H-10.html#%_idx_262">tree accumulation</a><br>
<a href="book-Z-H-16.html#%_idx_2186"><tt>tree-&gt;list...</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1712"><tt>tree-map</tt></a><br>
<a href="book-Z-H-11.html#%_idx_712">tree-recursive process</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-11.html#%_idx_776">order of growth</a><br>
<a href="book-Z-H-17.html#%_idx_2342">trigonometric relations</a><br>
<a href="book-Z-H-10.html#%_idx_368">true</a><br>
<a href="book-Z-H-10.html#%_idx_376"><tt>true</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4434"><tt>true?</tt></a><br>
<a href="book-Z-H-10.html#%_idx_146">truncation error</a><br>
<a href="book-Z-H-28.html#%_idx_4894">truth maintenance</a><br>
<a href="book-Z-H-28.html#%_idx_4910"><tt>try-again</tt></a><br>
<a href="book-Z-H-26.html#%_idx_4560">Turing machine</a><br>
<a href="book-Z-H-26.html#%_idx_4556">Turing, Alan M.</a>, <a href="book-Z-H-26.html#%_idx_4590">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1820">Turner, David</a>, <a href="book-Z-H-24.html#%_idx_3996">[2]</a>, 
<a href="book-Z-H-24.html#%_idx_4174">[3]</a><br>
<a href="book-Z-H-33.html#%_idx_5870">type field</a><br>
<a href="book-Z-H-17.html#%_idx_2296">type tag</a>, <a href="book-Z-H-17.html#%_idx_2366">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2548">two-level</a><br>
type(s)
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2576">cross-type operations</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-17.html#%_idx_2432">dispatching on</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2768">hierarchy in symbolic algebra</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2592">hierarchy of</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2612">lowering</a>, <a href="book-Z-H-18.html#%_idx_2640">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2616">multiple subtype and supertype</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2608">raising</a>, <a href="book-Z-H-18.html#%_idx_2634">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2598">subtype</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2602">supertype</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2606">tower of</a><br>
<a href="book-Z-H-24.html#%_idx_4114">type-inferencing mechanism</a><br>
<a href="book-Z-H-17.html#%_idx_2370"><tt>type-tag</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2560">using Scheme data types</a><br>
<a href="book-Z-H-33.html#%_idx_5860">typed pointer</a><br>
<a href="book-Z-H-10.html#%_idx_202">typing input expressions</a><p>

<p><p>

<br>
<a href="book-Z-H-21.html#%_idx_3054">unbound variable</a><br>
<a href="book-Z-H-34.html#%_idx_6030"><tt>unev</tt> register</a><br>
<a href="book-Z-H-29.html#%_idx_5210">unification</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5044">discovery of algorithm</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5362">implementation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-29.html#%_idx_5214">pattern matching vs.</a>, 
<a href="book-Z-H-29.html#%_idx_5224">[2]</a><br>
<a href="book-Z-H-29.html#%_idx_5364"><tt>unify-match</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2108"><tt>union-set</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2194">binary-tree representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2134">ordered-list representation</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-16.html#%_idx_2122">unordered-list representation</a><br>
<a href="book-Z-H-29.html#%_idx_5424"><tt>unique</tt> (query language)</a><br>
<a href="book-Z-H-15.html#%_idx_1844"><tt>unique-pairs</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1922">unit square</a><br>
<a href="book-Z-H-18.html#%_idx_2658">univariate polynomial</a><br>
<a href="book-Z-H-26.html#%_idx_4552">universal machine</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6196">explicit-control evaluator as</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6200">general-purpose computer as</a><br>
<a href="book-Z-H-9.html#%_idx_78">University of California at Berkeley</a><br>
<a href="book-Z-H-29.html#%_idx_5064">University of Edinburgh</a><br>
<a href="book-Z-H-29.html#%_idx_5062">University of Marseille</a><br>
<a href="book-Z-H-34.html#%_idx_6188">UNIX</a>, <a href="book-Z-H-35.html#%_idx_6500">[2]</a><br>
<a href="book-Z-H-34.html#%_idx_6152"><tt>unknown-expression-type</tt></a><br>
<a href="book-Z-H-34.html#%_idx_6154"><tt>unknown-procedure-type</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2114">unordered-list representation of sets</a><br>
unspecified values
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_230"><tt>define</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1366"><tt>display</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3476"><tt>if</tt> without alternative</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-14.html#%_idx_1368"><tt>newline</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-20.html#%_idx_2866"><tt>set!</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3150"><tt>set-car!</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-22.html#%_idx_3154"><tt>set-cdr!</tt></a><br>
<a href="book-Z-H-15.html#%_idx_1896"><tt>up-split</tt></a><br>
<a href="book-Z-H-32.html#%_idx_5702"><tt>update-insts!</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1504"><tt>upper-bound</tt></a><br>
<a href="book-Z-H-27.html#%_idx_4752">upward compatibility</a><br>
<a href="book-Z-H-26.html#%_idx_4586"><tt>user-initial-environment</tt> (MIT Scheme)</a><br>
<a href="book-Z-H-26.html#%_idx_4538"><tt>user-print</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-35.html#%_idx_6480">modified for compiled code</a><p>

<p><p>

<br>
<a href="book-Z-H-23.html#%_idx_3656">V operation on semaphore</a><br>
<a href="book-Z-H-34.html#%_idx_6022"><tt>val</tt> register</a><br>
value
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_186">of a combination</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_212">of an expression</a>, 
<em>see also</em> unspecified values
<br>
<a href="book-Z-H-32.html#%_idx_5728"><tt>value-proc</tt></a><br>
<a href="book-Z-H-10.html#%_idx_220">variable</a>, <em>see also</em> local variable
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_586">bound</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_592">free</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_596">scope of</a>, 
<em>see also</em> scope of a variable
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-21.html#%_idx_3056">unbound</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-10.html#%_idx_222">value of</a>, <a href="book-Z-H-21.html#%_idx_3052">[2]</a><br>
<a href="book-Z-H-18.html#%_idx_2688"><tt>variable</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2224">variable-length code</a><br>
<a href="book-Z-H-16.html#%_idx_2064"><tt>variable?</tt></a>, <a href="book-Z-H-26.html#%_idx_4284">[2]</a><br>
<a href="book-Z-H-33.html#%_idx_5842">vector (data structure)</a><br>
vector (mathematical)
<br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1800">operations on</a>, 
<a href="book-Z-H-15.html#%_idx_1930">[2]</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1912">in picture-language frame</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1928">represented as pair</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-15.html#%_idx_1798">represented as sequence</a><br>
<a href="book-Z-H-33.html#%_idx_5844"><tt>vector-ref</tt> (primitive procedure)</a><br>
<a href="book-Z-H-33.html#%_idx_5848"><tt>vector-set!</tt> (primitive procedure)</a><br>
<a href="book-Z-H-16.html#%_idx_1996">Venus</a><br>
<a href="book-Z-H-28.html#%_idx_4958"><tt>verbs</tt></a><br>
<a href="book-Z-H-10.html#%_idx_506">very high-level language</a><p>

<p><p>

<br>
<a href="book-Z-H-20.html#%_idx_3012">Wadler, Philip</a><br>
<a href="book-Z-H-24.html#%_idx_4112">Wadsworth, Christopher</a><br>
<a href="book-Z-H-14.html#%_idx_1434">Wagner, Eric G.</a><br>
<a href="book-Z-H-15.html#%_idx_1874">Walker, Francis Amasa</a><br>
<a href="book-Z-H-12.html#%_idx_1016">Wallis, John</a><br>
<a href="book-Z-H-25.html#%_idx_4206">Wand, Mitchell</a>, <a href="book-Z-H-34.html#%_idx_6068">[2]</a><br>
<a href="book-Z-H-15.html#%_idx_1760">Waters, Richard C.</a><br>
<a href="book-Z-H-16.html#%_idx_2266"><tt>weight</tt></a><br>
<a href="book-Z-H-16.html#%_idx_2256"><tt>weight-leaf</tt></a><br>
<a href="book-Z-H-13.html#%_idx_1254">Weyl, Hermann</a><br>
``what is'' vs. ``how to'' description, <em>see</em> declarative vs. imperative knowledge
<br>
<a href="book-Z-H-29.html#%_idx_5144"><tt>wheel</tt> (rule)</a>, 
<a href="book-Z-H-29.html#%_idx_5278">[2]</a><br>
<a href="book-Z-H-14.html#%_idx_1520"><tt>width</tt></a><br>
<a href="book-Z-H-14.html#%_idx_1510">width of an interval</a><br>
<a href="book-Z-H-10.html#%_idx_210">Wilde, Oscar (Perlis's paraphrase of)</a><br>
<a href="book-Z-H-11.html#%_idx_884">Wiles, Andrew</a><br>
<a href="book-Z-H-28.html#%_idx_4870">Winograd, Terry</a><br>
<a href="book-Z-H-28.html#%_idx_4906">Winston, Patrick Henry</a>, 
<a href="book-Z-H-28.html#%_idx_4974">[2]</a><br>
<a href="book-Z-H-22.html#%_idx_3334">wire, in digital circuit</a><br>
<a href="book-Z-H-9.html#%_idx_110">Wisdom, Jack</a><br>
<a href="book-Z-H-24.html#%_idx_3814">Wise, David S.</a><br>
<a href="book-Z-H-14.html#%_idx_1306">wishful thinking</a>, 
<a href="book-Z-H-16.html#%_idx_2050">[2]</a><br>
<a href="book-Z-H-20.html#%_idx_2858"><tt>withdraw</tt></a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-23.html#%_idx_3592">problems in concurrent system</a><br>
<a href="book-Z-H-23.html#%_idx_3676"><tt>without-interrupts</tt></a><br>
<a href="book-Z-H-24.html#%_idx_3728">world line of a particle</a>, 
<a href="book-Z-H-24.html#%_idx_4156">[2]</a><br>
<a href="book-Z-H-24.html#%_idx_3884">Wright, E. M.</a><br>
<a href="book-Z-H-14.html#%_idx_1436">Wright, Jesse B.</a><p>

<p><p>

<br>
<a href="book-Z-H-15.html#%_idx_1934"><tt>xcor-vect</tt></a><br>
<a href="book-Z-H-9.html#%_idx_64">Xerox Palo Alto Research Center</a>, 
<a href="book-Z-H-22.html#%_idx_3494">[2]</a><p>

<p><p>

<br>
<a href="book-Z-H-26.html#%_idx_4628"><em>Y</em> operator</a><br>
<a href="book-Z-H-15.html#%_idx_1936"><tt>ycor-vect</tt></a><br>
<a href="book-Z-H-33.html#%_idx_5944">Yochelson, Jerome C.</a><p>

<p><p>

<br>
<a href="book-Z-H-28.html#%_idx_4900">Zabih, Ramin</a><br>
<a href="book-Z-H-24.html#%_idx_4036">zero crossings of a signal</a>, 
<a href="book-Z-H-24.html#%_idx_4040">[2]</a>, <a href="book-Z-H-24.html#%_idx_4048">[3]</a><br>
<a href="book-Z-H-18.html#%_idx_2570">zero test (generic)</a><br>
&nbsp;&nbsp;&nbsp;&nbsp;<a href="book-Z-H-18.html#%_idx_2754">for polynomials</a><br>
<a href="book-Z-H-9.html#%_idx_80">Zetalisp</a><br>
<a href="book-Z-H-14.html#%_idx_1428">Zilles, Stephen N.</a><br>
<a href="book-Z-H-18.html#%_idx_2818">Zippel, Richard E.</a><p>


<p>


<p>


<p>


<p><div class=navigation>[Go to <span><a href="book.html">first</a>, <a href="book-Z-H-37.html">previous</a></span><span class=disable>, next</span> page<span>; &nbsp;&nbsp;</span><span><a href="book-Z-H-4.html#%_toc_start">contents</a></span><span class=disable><span>; &nbsp;&nbsp;</span>index</span>]</div><p>

</body>
</html>
